Scheduling on parallel machines to minimise maximum lateness for the customer order problem

Ling-Huey Su, Ping-Shun Chen and Szu-Yin Chen

International Journal of Systems Science, 2013, vol. 44, issue 5, 926-936

Abstract: This article addresses the customer order problem where jobs are scheduled on a set of parallel machines and dispatched in batches. A machine can process only one job at a time, whereas multiple machines can simultaneously process jobs in a batch. The evaluation of the performance is minimisation of maximum lateness. The problem is designated as . Three heuristics, based on simple scheduling rules, for each problem are proposed and their tight worst case bounds are found. Computational experiments are also conducted to evaluate the effectiveness of the heuristics.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207721.2011.649366 (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:taf:tsysxx:v:44:y:2013:i:5:p:926-936

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TSYS20

DOI: 10.1080/00207721.2011.649366

Access Statistics for this article

International Journal of Systems Science is currently edited by Visakan Kadirkamanathan

More articles in International Journal of Systems Science from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().