Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Management Science
Article . 1985 . Peer-reviewed
Data sources: Crossref
https://dx.doi.org/10.1287/mns...
Article
Data sources: Microsoft Academic Graph
Research Papers in Economics
Article . 1985
Data sources: Research Papers in Economics
 View all 3 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Scheduling the General Job-Shop

Scheduling the general job-shop
descriptionPublicationkeyboard_double_arrow_right Article 01 May 1985 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Management Science, volume 31, pages 594-598 (issn: 0025-1909, eissn: 1526-5501, Copyright policy )
Authors: Jeffrey R. Barker; Graham B. McMahon;

doi: 10.1287/mnsc.31.5.594

Scheduling the General Job-Shop

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.

Related Organizations
Keywords

Deterministic scheduling theory in operations research, branch and bound, search tree, job shop, deterministic [production/scheduling], optimum schedules for job-shops

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 63
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Top 1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
63
Top 10%
Top 1%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!
uploadUpload now