Just-in-time scheduling with controllable processing times on parallel machines

Yaron Leyvand (), Dvir Shabtay (), George Steiner () and Liron Yedidsion ()
Additional contact information
Yaron Leyvand: Ben-Gurion University of the Negev
Dvir Shabtay: Ben-Gurion University of the Negev
George Steiner: McMaster University
Liron Yedidsion: Technion—Israel Institute of Technology

Journal of Combinatorial Optimization, 2010, vol. 19, issue 3, No 6, 347-368

Abstract: Abstract We study scheduling problems with controllable processing times on parallel machines. Our objectives are to maximize the weighted number of jobs that are completed exactly at their due date and to minimize the total resource allocation cost. We consider four different models for treating the two criteria. We prove that three of these problems are $\mathcal{NP}$ -hard even on a single machine, but somewhat surprisingly, the problem of maximizing an integrated objective function can be solved in polynomial time even for the general case of a fixed number of unrelated parallel machines. For the three $\mathcal{NP}$ -hard versions of the problem, with a fixed number of machines and a discrete resource type, we provide a pseudo-polynomial time optimization algorithm, which is converted to a fully polynomial time approximation scheme.

Keywords: Just-in-time scheduling; Fixed interval scheduling; Unrelated parallel machines; Controllable processing times; Resource allocation (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9270-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:19:y:2010:i:3:d:10.1007_s10878-009-9270-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9270-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().