NDLI: Two-machine, no-wait job shop problem with separable setup times and single-server constraints

Content Provider	Springer Nature Link
Author	Samarghandi, Hamed ElMekkawy, Tarek Y.
Copyright Year	2012
Abstract	No-wait job shop scheduling problems refer to the set of problems in which a number of jobs are available for processing on a number of machines in a job shop context with the added constraint that there should be no waiting time between consecutive operations of the jobs. In this paper, a two-machine, no-wait job shop problem with separable setup times and a single-server constraint is considered. The considered performance measure is the makespan. This problem is strongly NP-hard. A mathematical model of the problem is developed and a number of propositions are proven for the special cases. Moreover, a genetic algorithm is proposed in this paper to find the optimal (or near-optimal) solutions. In order to evaluate the developed algorithm, a number of small instances are solved to optimality using the developed mathematical model. The proposed algorithm is able to find the optimal solution of all of these cases. For larger instances, the developed algorithm has been compared with the 2-opt algorithm as well as a proposed lower bound. Computational results show the efficiency of the proposed algorithm in generating good quality solutions compared to the developed lower bounds and 2-opt algorithm.
Starting Page	295
Ending Page	308
Page Count	14
File Format	PDF
ISSN	02683768
Journal	The International Journal of Advanced Manufacturing Technology
Volume Number	65
Issue Number	1-4
e-ISSN	14333015
Language	English
Publisher	Springer-Verlag
Publisher Date	2012-05-13
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Two-machine job shop No-wait Separable setup Makespan Single server Industrial and Production Engineering Production/Logistics/Supply Chain Mechanical Engineering Computer-Aided Engineering (CAD, CAE) and Design
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 and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion

Minimizing makespan in a two-machine no-wait flow shop with batch processing machines

A constructive heuristic for minimizing makespan in no-wait flow shop scheduling

No-wait two-stage multiprocessor flow shop scheduling with unit setup

A two-phase algorithm for multiple-route job shop scheduling problem subject to makespan

Makespan minimization in a job shop with a BPM using simulated annealing

A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems

A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion

Sequencing of an M machine flow shop with setup, processing and removal times separated

Two-machine, no-wait job shop problem with separable setup times and single-server constraints

Similar Documents

A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion

Minimizing makespan in a two-machine no-wait flow shop with batch processing machines

A constructive heuristic for minimizing makespan in no-wait flow shop scheduling

No-wait two-stage multiprocessor flow shop scheduling with unit setup

A two-phase algorithm for multiple-route job shop scheduling problem subject to makespan

Makespan minimization in a job shop with a BPM using simulated annealing

A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems

A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion

Sequencing of an M machine flow shop with setup, processing and removal times separated

Two-machine, no-wait job shop problem with separable setup times and single-server constraints