An efficient algorithm for the job-shop problem with two jobs

Computing

Volumn 40, Issue 4, 1988, Pages 353-359

  Brucker, P ^a  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

ASM Subject Classification: 90B35; Job shop scheduling; shortest path

Indexed keywords

MATHEMATICAL TECHNIQUES--ALGORITHMS; OPERATIONS RESEARCH; SCHEDULING;

JOB-SHOP SCHEDULING; SHORTEST PATH;

COMPUTER PROGRAMMING;

EID: 0024142036     PISSN: 0010485X     EISSN: 14365057     Source Type: Journal    
DOI: 10.1007/BF02276919     Document Type: Article

References (8)

1. A graphical approach to production scheduling problems
2. A geometric model and a graphical algorithm for a sequencing problem
3. An efficient optimal algorithm for the two-machines, unit-time, jobshop, schedule-length problem
4. An extension of Johnson's results on job lot scheduling
5. Solution of the Akers-Friedman scheduling problem