Scheduling the General Job-Shop

Jeffrey R. Barker and Graham B. McMahon
Additional contact information
Jeffrey R. Barker: Scientia Pty Ltd.
Graham B. McMahon: Department of Computer Science, University of New South Wales, Kensington, New South Wales, Australia 2033

Management Science, 1985, vol. 31, issue 5, 594-598

Abstract: A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.

Keywords: production/scheduling: job shop; deterministic (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.31.5.594 (application/pdf)

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:inm:ormnsc:v:31:y:1985:i:5:p:594-598

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().