Batch scheduling on a two-machine jobshop with machine-dependent setup times

Gur Mosheiov*, Daniel Oron

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m a≥ 3) is known to be strongly NP-hard even with no setup times. We focus in this article on the two-machine case. We assume UET jobs and consider batching with batch availability and machine-dependent setup times. We introduce an efficient (O(√n)) algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances.

Original languageAmerican English
Pages (from-to)676-684
Number of pages9
JournalNaval Research Logistics
Volume58
Issue number7
DOIs
StatePublished - Oct 2011

Keywords

  • batch scheduling
  • jobshop
  • setup-time
  • unit execution time jobs

Fingerprint

Dive into the research topics of 'Batch scheduling on a two-machine jobshop with machine-dependent setup times'. Together they form a unique fingerprint.

Cite this