article

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

Authors:

J. J. Yuan,

Z. H. Liu,

C. T. Ng,

T. C. ChengAuthors Info & Claims

Journal of Scheduling, Volume 9, Issue 6

Pages 499 - 513

https://doi.org/10.1007/s10951-006-8776-2

Published: 01 December 2006 Publication History

Abstract

In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an $$O(n (\frac{n}{m}+1)^m)$$ time dynamic programming algorithm and an $$O(mk^{k}P^{2k-1})$$ time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of distinct release dates and P is the sum of the setup times of all the families and the processing times of all the jobs. We further give a heuristic with a performance ratio 2. We also give a polynomial-time approximation scheme (PTAS) for the problem.

References

[1]

Brucker, P., Scheduling Algorithms , Springer-Verlag, Berlin 2001.

Digital Library

Google Scholar

[2]

Bruno, J. and P. Downey, Complexity of task sequencing with deadlines, setup times and changeover costs, SIAM Journal on Computing , 7 , 393-404 (1978).

Google Scholar

[3]

Cheng, T. C. E., C. T. Ng and J. J. Yuan, The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard, Journal of Scheduling , 6 , 483-490 (2003).

Digital Library

Google Scholar

[4]

Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness , Freeman, San Francisco, CA, 1979.

Digital Library

Google Scholar

[5]

Ghosh, J. B. and J. N. D. Gupta, Batch scheduling to minimize maximum lateness, Operations Research Letters , 21 , 77-80 (1997).

Digital Library

Google Scholar

[6]

Monma, C. L. and C. N. Potts, On the complexity of scheduling with batch setup times, Operations Research , 37 , 798-804 (1988).

Google Scholar

[7]

Potts, C. N., and M. Y. Kovalyov, Scheduling with batching: a review, European Journal of Operational Research , 120 , 228-249 (2000).

Crossref

Google Scholar

Cited By

View all

de Freitas MFuchigami H(2022)A new technology implementation via mathematical modeling for the sequence-dependent setup times of industrial problemsComputers and Industrial Engineering10.1016/j.cie.2022.108624172:PBOnline publication date: 1-Oct-2022
https://dl.acm.org/doi/10.1016/j.cie.2022.108624
Cai YKutanoglu EHasenbein JQin J(2018)Single-machine scheduling with advanced process control constraintsJournal of Scheduling10.1007/s10951-010-0215-815:2(165-179)Online publication date: 24-Dec-2018
https://dl.acm.org/doi/10.1007/s10951-010-0215-8
Sels VVanhoucke M(2012)A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setupsComputers and Operations Research10.1016/j.cor.2011.12.01439:10(2346-2358)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1016/j.cor.2011.12.014

Index Terms

Recommendations

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

In this paper we consider the unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an O(n(n/m+1)^m) time dynamic programming algorithm ...
Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times

We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing ...
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

We consider the problem of scheduling family jobs with release dates on a bounded batching machine to minimize the makespan. A polynomial-time approximation scheme for the identical job size model and an approximation algorithm with a worst-case ratio ...

Comments

Information & Contributors

Information

Published In

Journal of Scheduling Volume 9, Issue 6

December 2006

76 pages

ISSN:1094-6136

Issue’s Table of Contents

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 December 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

de Freitas MFuchigami H(2022)A new technology implementation via mathematical modeling for the sequence-dependent setup times of industrial problemsComputers and Industrial Engineering10.1016/j.cie.2022.108624172:PBOnline publication date: 1-Oct-2022
https://dl.acm.org/doi/10.1016/j.cie.2022.108624
Cai YKutanoglu EHasenbein JQin J(2018)Single-machine scheduling with advanced process control constraintsJournal of Scheduling10.1007/s10951-010-0215-815:2(165-179)Online publication date: 24-Dec-2018
https://dl.acm.org/doi/10.1007/s10951-010-0215-8
Sels VVanhoucke M(2012)A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setupsComputers and Operations Research10.1016/j.cor.2011.12.01439:10(2346-2358)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1016/j.cor.2011.12.014

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times

The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations