NDLI: Approximation algorithms for two-machine flow shop scheduling with batch setup times

Content Provider	Springer Nature Link
Author	Chen, Bo Potts, Chris N. Strusevich, Vitaly A.
Copyright Year	1998
Abstract	In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow shop with the objective of minimizing the makespan. Jobs are grouped into batches. A sequence independent batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. Besides its practical interest, this problem is a direct generalization of the classical two-machine flow shop problem with no grouping of jobs, which can be solved optimally by Johnson's well-known algorithm. The problem under investigation is known to be NP-hard. We propose two O(n logn) time heuristic algorithms. The first heuristic, which creates a schedule with minimum total setup time by forcing all jobs in the same batch to be sequenced in adjacent positions, has a worst-case performance ratio of 3/2. By allowing each batch to be split into at most two sub-batches, a second heuristic is developed which has an improved worst-case performance ratio of 4/3. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
Starting Page	255
Ending Page	271
Page Count	17
File Format	PDF
ISSN	00255610
Journal	Mathematical Programming
Volume Number	82
Issue Number	1-2
e-ISSN	14364646
Language	English
Publisher	Springer-Verlag
Publisher Date	1998-01-01
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Scheduling Flow shop Batch setup times Approximation algorithm Performance analysis Mathematics of Computing Numerical Analysis Combinatorics Calculus of Variations and Optimal Control Optimization Mathematical and Computational Physics Mathematical Methods in Physics Numerical and Computational Methods Operation Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Mathematics 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

Approximability of flow shop scheduling

Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine

Makespan minimization in open shops: A polynomial time approximation scheme

Improved approximation algorithms for capacitated facility location problems

Machine scheduling with resource dependent processing times

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times

Rounding algorithms for covering problems

Scheduling uniform machines on-line requires nondecreasing speed ratios

Minimizing average completion time in the presence of release dates

Approximation algorithms for two-machine flow shop scheduling with batch setup times

Similar Documents

Approximability of flow shop scheduling

Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine

Makespan minimization in open shops: A polynomial time approximation scheme

Improved approximation algorithms for capacitated facility location problems

Machine scheduling with resource dependent processing times

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times

Rounding algorithms for covering problems

Scheduling uniform machines on-line requires nondecreasing speed ratios

Minimizing average completion time in the presence of release dates

Approximation algorithms for two-machine flow shop scheduling with batch setup times