No-wait scheduling of position dependent jobs and adjustable processing intervals

Daniel Oron
Additional contact information
Daniel Oron: University of Sydney Business School, NSW, Australia

Journal of the Operational Research Society, 2015, vol. 66, issue 5, 732-736

Abstract: In this paper, we consider a single machine no-wait scheduling model whereby job processing times are general functions of their position in the job sequence. We assume that the single machine must operate at a certain cycle, which can be determined by the scheduler. Furthermore, exactly one job has to be completed by the end of each cycle. Using different variations of the Linear Assignment Problem formulation, we develop polynomial time algorithms for minimizing the following objectives: makespan, total completion time, maximum earliness and total earliness.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v66/n5/pdf/jors201454a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v66/n5/full/jors201454a.html Link to full text HTML (text/html)
Access to full text is restricted to subscribers.

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:pal:jorsoc:v:66:y:2015:i:5:p:732-736

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().