NDLI: Customer order scheduling problem: a comparative metaheuristics study

Content Provider	Springer Nature Link
Author	Hazır, Öncü Günalay, Yavuz Erel, Erdal
Copyright Year	2007
Abstract	The customer order scheduling problem (COSP) is defined as to determine the sequence of tasks to satisfy the demand of customers who order several types of products produced on a single machine. A setup is required whenever a product type is launched. The objective of the scheduling problem is to minimize the average customer order flow time. Since the customer order scheduling problem is known to be strongly NP-hard, we solve it using four major metaheuristics and compare the performance of these heuristics, namely, simulated annealing, genetic algorithms, tabu search, and ant colony optimization. These are selected to represent various characteristics of metaheuristics: nature-inspired vs. artificially created, population-based vs. local search, etc. A set of problems is generated to compare the solution quality and computational efforts of these heuristics. Results of the experimentation show that tabu search and ant colony perform better for large problems whereas simulated annealing performs best in small-size problems. Some conclusions are also drawn on the interactions between various problem parameters and the performance of the heuristics.
Starting Page	589
Ending Page	598
Page Count	10
File Format	PDF
ISSN	02683768
Journal	The International Journal of Advanced Manufacturing Technology
Volume Number	37
Issue Number	5-6
e-ISSN	14333015
Language	English
Publisher	Springer-Verlag
Publisher Date	2007-04-03
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Metaheuristics Customer order scheduling Simulated annealing Genetic algorithms Tabu search Ant colony optimization Computer-Aided Engineering (CAD, CAE) and Design Mechanical Engineering Production/Logistics Industrial and Production Engineering
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

Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems

Sensitivity search for the rescheduling of semiconductor photolithography operations

Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization

Simulated annealing and ant colony optimization algorithms for the dynamic throughput maximization problem

Flexible job shop scheduling with tabu search algorithms

A fuzzy multi-objective programming for scheduling of weighted jobs on a single machine

Due window scheduling with sequence-dependent setup on parallel machines using three hybrid metaheuristic algorithms

Genetic algorithms for batch sizing and production scheduling

A hybrid simulated annealing-tabu search algorithm for the part selection and machine loading problems in flexible manufacturing systems

Customer order scheduling problem: a comparative metaheuristics study

Similar Documents

Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems

Sensitivity search for the rescheduling of semiconductor photolithography operations

Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization

Simulated annealing and ant colony optimization algorithms for the dynamic throughput maximization problem

Flexible job shop scheduling with tabu search algorithms

A fuzzy multi-objective programming for scheduling of weighted jobs on a single machine

Due window scheduling with sequence-dependent setup on parallel machines using three hybrid metaheuristic algorithms

Genetic algorithms for batch sizing and production scheduling

A hybrid simulated annealing-tabu search algorithm for the part selection and machine loading problems in flexible manufacturing systems

Customer order scheduling problem: a comparative metaheuristics study