File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: ON J-MAXIMAL AND J-MINIMAL FLOW-SHOP SCHEDULES.

TitleON J-MAXIMAL AND J-MINIMAL FLOW-SHOP SCHEDULES.
Authors
Chin, Francis YTsai, Long Lieh
Keywordsflow-shop schedules
heuristic schedules
Job schedulmg
minimum fimshmg time
NP-complete
optional schedules
Issue Date1981
PublisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/jacm
Citation
Journal Of The Acm, 1981, v. 28 n. 3, p. 462-476 How to Cite?
DOI: http://dx.doi.org/10.1145/322261.322265
AbstractScheduling problems are considered for a common kind of flow shop where the execution time for certain tasks in each job is always longer or shorter than that for the other tasks. NP-completeness is shown for some cases, simple optimal algorithms are found for the others, and bounds are given for the worst cases.
Persistent Identifierhttp://hdl.handle.net/10722/152207
ISSN
0004-5411
2023 Impact Factor: 2.3
2023 SCImago Journal Rankings: 2.866
ISI Accession Number ID
WOS:A1981LX84200004

 

DC FieldValueLanguage
dc.contributor.authorChin, Francis Yen_US
dc.contributor.authorTsai, Long Liehen_US
dc.date.accessioned2012-06-26T06:36:31Z-
dc.date.available2012-06-26T06:36:31Z-
dc.date.issued1981en_US
dc.identifier.citationJournal Of The Acm, 1981, v. 28 n. 3, p. 462-476en_US
dc.identifier.issn0004-5411en_US
dc.identifier.urihttp://hdl.handle.net/10722/152207-
dc.description.abstractScheduling problems are considered for a common kind of flow shop where the execution time for certain tasks in each job is always longer or shorter than that for the other tasks. NP-completeness is shown for some cases, simple optimal algorithms are found for the others, and bounds are given for the worst cases.en_US
dc.languageengen_US
dc.publisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/jacmen_US
dc.relation.ispartofJournal of the ACMen_US
dc.subjectflow-shop schedules-
dc.subjectheuristic schedules-
dc.subjectJob schedulmg-
dc.subjectminimum fimshmg time-
dc.subjectNP-complete-
dc.subjectoptional schedules-
dc.titleON J-MAXIMAL AND J-MINIMAL FLOW-SHOP SCHEDULES.en_US
dc.typeArticleen_US
dc.identifier.emailChin, Francis Y:chin@cs.hku.hken_US
dc.identifier.authorityChin, Francis Y=rp00105en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1145/322261.322265en_US
dc.identifier.scopuseid_2-s2.0-0019587481en_US
dc.identifier.volume28en_US
dc.identifier.issue3en_US
dc.identifier.spage462en_US
dc.identifier.epage476en_US
dc.identifier.isiWOS:A1981LX84200004-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChin, Francis Y=7005101915en_US
dc.identifier.scopusauthoridTsai, Long Lieh=7203034041en_US
dc.identifier.issnl0004-5411-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats