Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey

Dvir Shabtay () and George Steiner ()
Additional contact information
Dvir Shabtay: Ben-Gurion University of the Negev
George Steiner: McMaster University

Chapter Chapter 1 in Just-in-Time Systems, 2012, pp 3-20 from Springer

Abstract: Abstract In just-in-time (JIT) scheduling, the usual objective is to minimize a cost function which includes a penalty for both the early and tardy completion of jobs. In this paper, we survey results for a cost function that is related to the number of early and tardy jobs rather than the actual earliness and tardiness values. More specifically, we study the problem of maximizing the weighted number of jobs which are completed exactly on their due date (i.e., in JIT mode). Our survey covers the literature for various scheduling environments both with fixed and controllable processing times. We also describe several new algorithms for certain flow-shop problems.

Keywords: Flow Shop; Feasible Schedule; Open Shop; Identical Parallel Machine; Unrelated Parallel Machine (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spochp:978-1-4614-1123-9_1

Ordering information: This item can be ordered from
http://www.springer.com/9781461411239

DOI: 10.1007/978-1-4614-1123-9_1

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().