A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness

Oliver Hinder and Andrew J. Mason

European Journal of Operational Research, 2017, vol. 262, issue 2, 411-423

Abstract: This paper focuses on the problem of scheduling n jobs with family setup times on a single machine with the objective of minimizing the maximum lateness. To solve this problem we develop a novel ordered-batch integer programing formulation. The formulation utilizes two properties of optimal solutions. Firstly, we observe that there is a restricted set of batches that we need to consider to find the optimal solution. Secondly, we know the order in which batches should be processed if they occur in an optimal solution.

Keywords: Scheduling; Family setup times; Maximum lateness; Single machine; Integer programing (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717301820
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:262:y:2017:i:2:p:411-423

DOI: 10.1016/j.ejor.2017.03.003

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().