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

Autor:	Szu-Yin Chen, Ping-Shun Chen, Ling-Huey Su
Rok vydání:	2013
Předmět:	Mathematical optimization Customer order Control and Systems Engineering Computer science Heuristics Computer Science Applications Theoretical Computer Science Scheduling (computing)
Zdroj:	International Journal of Systems Science. 44:926-936
ISSN:	1464-5319 0020-7721
DOI:	10.1080/00207721.2011.649366
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::7b197afc160db8974c2111a901a4e5d6 https://doi.org/10.1080/00207721.2011.649366 Zobrazit plný text záznamu