On-line algorithms for hybrid flow shop scheduling

Title:
On-line algorithms for hybrid flow shop scheduling
Authors:
Havill, Jessen T.; Mao, Weizhen
Citation:
J.T. Havill, W. Mao, On-line algorithms for hybrid flow shop scheduling problems, Proceedings of the Fourth International Conference on Computer Science and Informatics, 1998, pp. 134–137.
Publisher:
Proceedings of the Fourth International Conference on Computer Science and Informatics
DATE ISSUED:
1998
PERMANENT LINK:
http://hdl.handle.net/2374.DEN/5002; http://hdl.handle.net/2374
Type:
Article; Book chapter
Language:
en_US
Description:
We study a hybrid flow shop scheduling problem, in which the execution of each job must go through multiple stages in one specific order and at each stage there are parallel machines available to process the jobs that have entered the stage. The objective is to minimize the makespan. In this paper, we propose two on-line algorithms based on the greedy strategy. We also present analysis on the performance of the algorithms.
Appears in Collections:
Faculty Publications

Full metadata record

DC FieldValue Language
dc.contributor.authorHavill, Jessen T.en
dc.contributor.authorMao, Weizhenen
dc.date.accessioned2013-01-02T16:23:23Zen
dc.date.accessioned2013-12-18T21:04:55Z-
dc.date.available2013-01-02T16:23:23Zen
dc.date.available2013-12-18T21:04:55Z-
dc.date.created1998en
dc.date.issued1998en
dc.identifier.citationJ.T. Havill, W. Mao, On-line algorithms for hybrid flow shop scheduling problems, Proceedings of the Fourth International Conference on Computer Science and Informatics, 1998, pp. 134–137.en_US
dc.identifier.urihttp://hdl.handle.net/2374.DEN/5002en
dc.identifier.urihttp://hdl.handle.net/2374-
dc.descriptionWe study a hybrid flow shop scheduling problem, in which the execution of each job must go through multiple stages in one specific order and at each stage there are parallel machines available to process the jobs that have entered the stage. The objective is to minimize the makespan. In this paper, we propose two on-line algorithms based on the greedy strategy. We also present analysis on the performance of the algorithms.en_US
dc.language.isoen_USen_US
dc.publisherProceedings of the Fourth International Conference on Computer Science and Informaticsen_US
dc.relation.ispartofFaculty Publicationsen_US
dc.titleOn-line algorithms for hybrid flow shop schedulingen_US
dc.typeArticleen_US
dc.typeBook chapteren_US
dc.contributor.institutionDenison Universityen_US
dc.date.digitized2013-01-02en
dc.contributor.repositoryDenison Resource Commonsen_US
All Items in The Five Colleges of Ohio Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.