The Machine Duplication Problem in a Job Shop with Two Jobs

DOI10.1111/j.1475-3995.1995.tb00004.xzbMath0868.90061OpenAlexW4250863829MaRDI QIDQ5689969

Gianpaolo Oriolo, Alessandro Agnetis

Publication date: 15 January 1997

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.1995.tb00004.x

zbMATH Keywords

job shop schedulingNP-completenessheuristicpolynomial timeflexible manufacturing cellscomplexity of the machine duplication problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (1)

A job-shop problem with one additional resource type

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient algorithm for the job-shop problem with two jobs
• The complexity of shop-scheduling problems with two or three jobs

This page was built for publication: The Machine Duplication Problem in a Job Shop with Two Jobs