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

Gur Mosheiov; Daniel Oron

doi:10.1002/nav.20473

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

Gur Mosheiov^*
, Daniel Oron

^*Corresponding author for this work

BA Business Department

Research output: Contribution to journal › Article › peer-review

5 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 language	English
Pages (from-to)	676-684
Number of pages	9
Journal	Naval Research Logistics
Volume	58
Issue number	7
DOIs	https://doi.org/10.1002/nav.20473
State	Published - Oct 2011

Keywords

batch scheduling
jobshop
setup-time
unit execution time jobs

Access to Document

10.1002/nav.20473

Cite this

@article{b5711253695f4383a6373db73a3c2fa5,

title = "Batch scheduling on a two-machine jobshop with machine-dependent setup times",

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.",

keywords = "batch scheduling, jobshop, setup-time, unit execution time jobs",

author = "Gur Mosheiov and Daniel Oron",

year = "2011",

month = oct,

doi = "10.1002/nav.20473",

language = "אנגלית",

volume = "58",

pages = "676--684",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley \& Sons Inc.",

number = "7",

}

TY - JOUR

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

AU - Mosheiov, Gur

AU - Oron, Daniel

PY - 2011/10

Y1 - 2011/10

N2 - 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.

AB - 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.

KW - batch scheduling

KW - jobshop

KW - setup-time

KW - unit execution time jobs

UR - https://www.scopus.com/pages/publications/80052301147

U2 - 10.1002/nav.20473

DO - 10.1002/nav.20473

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:80052301147

SN - 0894-069X

VL - 58

SP - 676

EP - 684

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 7

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this