The proportionate two-machine no-wait job shop scheduling problem

DOI10.1016/J.EJOR.2016.01.010zbMATH Open1346.90360OpenAlexW2230700996MaRDI QIDQ322845FDOQ322845

C. Koulamas, S. S. Panwalkar

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.01.010

zbMATH Keywords

job shopno-waitproportionate

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• The two-machine no-wait general and proportionate open shop makespan problem
• Complexity of Scheduling Shops with No Wait in Process
• Flowshop sequencing problem with ordered processing time matrices: A general case
• Some no-wait shops scheduling problems: Complexity aspect
• Inapproximability results for no-wait job shop scheduling.

Cited In (5)

• An asynchronous parallel disassembly planning based on genetic algorithm
• A survey of job shop scheduling problem: the types and models
• On the complexity of proportionate open shop and job shop problems
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
• A survey of scheduling problems with no-wait in process

   Recommendations

• Two-machine flow shop scheduling problems with no-wait jobs 👍 👎
• The two-machine no-wait general and proportionate open shop makespan problem 👍 👎
• Title not available (Why is that?) 👍 👎
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Two-Machine No-Wait Flow Shop Scheduling Problem with Precedence Constraints 👍 👎
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness 👍 👎
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection 👍 👎
• SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE 👍 👎
• A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays 👍 👎

This page was built for publication: The proportionate two-machine no-wait job shop scheduling problem

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