The two-machine no-wait general and proportionate open shop makespan problem

DOI10.1016/J.EJOR.2014.04.030zbMATH Open1338.90180OpenAlexW2090643029MaRDI QIDQ296784FDOQ296784

Authors: S. S. Panwalkar, C. Koulamas 

Publication date: 23 June 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.2014.04.030

Recommendations

• The proportionate two-machine no-wait job shop scheduling problem
• The three-machine proportionate open shop and mixed shop minimum makespan problems
• Scheduling two-machine no-wait open shops to minimize makespan
• scientific article; zbMATH DE number 1279216
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS

zbMATH Keywords

schedulingopen shopno wait

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling. Theory, algorithms, and systems.
• Open Shop Scheduling to Minimize Finish Time
• Title not available (Why is that?)
• Open shop scheduling with machine dependent processing times
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Permutation flow shops with exact time lags to minimise maximum lateness
• Review of the ordered and proportionate flow shop scheduling research
• Open-shop scheduling problems with dominated machines
• Complexity of Scheduling Shops with No Wait in Process
• Unit Execution Time Shop Problems
• Flowshop sequencing problem with ordered processing time matrices: A general case
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Scheduling ordered open shops
• Scheduling two-machine no-wait open shops to minimize makespan

Cited In (8)

• Reentrant open shop scheduling problem with time lags and no-wait constraints
• Scheduling two-machine no-wait open shops to minimize makespan
• On the complexity of proportionate open shop and job shop problems
• The proportionate two-machine no-wait job shop scheduling problem
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• The LPT heuristic for minimizing total load on a proportionate openshop
• A survey of scheduling problems with no-wait in process

This page was built for publication: The two-machine no-wait general and proportionate open shop makespan problem

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