Online Machine Scheduling with Family Setups

Lele Zhang and Andrew Wirth
Additional contact information
Lele Zhang: Department of Mechanical Engineering, The University of Melbourne, VIC 3010, Australia
Andrew Wirth: Department of Mechanical Engineering, The University of Melbourne, VIC 3010, Australia

Asia-Pacific Journal of Operational Research (APJOR), 2016, vol. 33, issue 04, 1-16

Abstract: We consider the problem of online scheduling a single machine with family setups under job availability. A setup must be scheduled when the next job comes from a different family from the last completed one, if any. The aim is to minimize the total completion time of all jobs. For the special case of identical processing times, we provide a lower bound for the competitive ratio and an online algorithm with its competitive analysis.

Keywords: Online scheduling; single machine; family setup (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595916500275
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:wsi:apjorx:v:33:y:2016:i:04:n:s0217595916500275

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595916500275

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().