The Machine Duplication Problem in a Job Shop with Two Jobs

DOI10.1111/J.1475-3995.1995.TB00004.XMaRDI QIDQ5689969zbMATH OpenOpenAlexFDO

Authors 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

complexity of the machine duplication problemflexible manufacturing cellsheuristicjob shop schedulingNP-completenesspolynomial time

Mathematics Subject Classification ID

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

Recommendations

• The complexity of two-job shop problems with multi-purpose unrelated machines.
• A flowshop scheduling problem with two operations per job
• Heuristics for short route job shop scheduling problems
• The complexity of cyclic shop scheduling problems
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs

Cites work

• An efficient algorithm for the job-shop problem with two jobs
• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The complexity of shop-scheduling problems with two or three jobs

Cited in

(3)

• Two-machine job-shop scheduling with one joint job
• A job-shop problem with one additional resource type
• Flow shop scheduling with inter-stage flexibility and blocking constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689969)