NDLI: Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs

Content Provider	Springer Nature Link
Author	Valente, Jorge M. S. Moreira, Maria R. A. Singh, Alok Alves, Rui A. F. S.
Copyright Year	2010
Abstract	In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet and present several algorithms based on this approach. These versions differ on the generation of both the initial population and the individuals added in the migration step, as well as on the use of local search. The proposed procedures are compared with the best existing heuristics, as well as with optimal solutions for the smaller instance sizes. The computational results show that the proposed algorithms clearly outperform the existing procedures and are quite close to the optimum. The improvement over the existing heuristics increases with both the difficulty and the size of the instances. The performance of the proposed genetic approach is improved by the initialization of the initial population, the generation of greedy randomized solutions, and the addition of the local search procedure. Indeed, the more sophisticated versions can obtain similar or better solutions and are much faster. The genetic version that incorporates all the considered features is the new heuristic of choice for small and medium size instances.
Starting Page	251
Ending Page	265
Page Count	15
File Format	PDF
ISSN	02683768
Journal	The International Journal of Advanced Manufacturing Technology
Volume Number	54
Issue Number	1-4
e-ISSN	14333015
Language	English
Publisher	Springer-Verlag
Publisher Date	2010-09-05
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Scheduling Single machine Quadratic earliness and tardiness Genetic algorithms Mechanical Engineering Computer-Aided Engineering (CAD, CAE) and Design Industrial and Production Engineering Production/Logistics
Content Type	Text
Resource Type	Article
Subject	Industrial and Manufacturing Engineering Control and Systems Engineering Mechanical Engineering Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A genetic algorithm for the single machine preemptive scheduling problem with linear earliness and quadratic tardiness penalties

Parallel machine scheduling with earliness-tardiness penalties and space limits

A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times

A block approach to earliness-tardiness scheduling problems

Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach

A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties

Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect

Multi-machine scheduling with deterioration effects and maintenance activities for minimizing the total earliness and tardiness costs

Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs

Similar Documents

A genetic algorithm for the single machine preemptive scheduling problem with linear earliness and quadratic tardiness penalties

Parallel machine scheduling with earliness-tardiness penalties and space limits

A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times

A block approach to earliness-tardiness scheduling problems

Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach

A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties

Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect

Multi-machine scheduling with deterioration effects and maintenance activities for minimizing the total earliness and tardiness costs

Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs