Just-in-Time Scheduling with Equal-Size Jobs

Ameur Soukhal () and Nguyen Huynh Toung ()
Additional contact information
Ameur Soukhal: Université François Rabelais
Nguyen Huynh Toung: University of Technology of Ho Chi Minh City

Chapter Chapter 6 in Just-in-Time Systems, 2012, pp 107-145 from Springer

Abstract: Abstract This chapter deals with common due date scheduling problem on single and parallel machines in which job processing times are identical. The objective is to minimize the total weighted earliness–tardiness. According to the common due date, two cases are considered. In the first case, the due date is given which involves that the common due date is enough early (restrictive version) or not (non-restrictive version) to constraint the optimal solution. In this case, there is no cost related to its value. The second case deals with unknown due date which is a decision variables. It means that the decision maker not only takes sequencing and scheduling decisions to minimize the total weighted earliness–tardiness but also determines the optimal value of due date which is specified as controllable parameter.

Keywords: Schedule Problem; Completion Time; Idle Time; Single Machine Schedule Problem; Identical Parallel Machine (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

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_6

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

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

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 ().