The machine duplication problem in a job shop with two jobs

International Transactions in Operational Research

Volumn 2, Issue 1, 1995, Pages 45-60

  Agnetis, Alessandro ^a   Oriolo, Gianpaolo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

computational complexity; flexible manufacturing cells; heuristics; job shop scheduling; NP completeness; tooling

Indexed keywords

EID: 0003884829     PISSN: 09696016     EISSN: None     Source Type: Journal    
DOI: 10.1016/0969-6016(95)00026-4     Document Type: Article

References (16)

1. Tool handling and scheduling in a two-machine flexible manufacturing cell
2. Tool handling synchronization in a flexible manufacturing cell
3. A non-numerical approach to production scheduling problems
4. A branch and bound approach for machine load balancing in flexible manufacturing systems
5. An efficient algorithm for the job-shop problem with two jobs
6. A synthesis of decision models for tool management in automated manufacturing
7. A geometric model and a graphical algorithm for a sequencing problem
8. A formal basis for the heuristic determination of minimum cost paths
9. Block angular structures and the loading problem in flexible manufacturing systems
10. Concurrent routing, sequencing, and setups for a two-machine flexible manufacturing cell
11. The complexity of scheduling problems with two or three jobs
12. Formulation and solution of nonlinear integer production planning problems in flexible manufacturing systems
13. Solution of the Akers-Friedman scheduling problem