Two-machine flow shops with limited machine availability
From MaRDI portal
Publication:5953341
DOI10.1016/S0377-2217(01)00083-2zbMath1007.90026OpenAlexW2065819816WikidataQ57387831 ScholiaQ57387831MaRDI QIDQ5953341
Günter Schmidt, Piotr Formanowicz, Jacek Błażewicz, Wiesław X. Kubiak, Joachim Breit
Publication date: 23 January 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00083-2
Related Items
Scheduling jobs and maintenance activities on parallel machines, A PTAS for non-resumable open shop scheduling with an availability constraint, A new approach for scheduling independent tasks with multiple modes, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Scheduling jobs in open shops with limited machine availability, Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate, An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint, An integrated production and preventive maintenance planning model, An improved algorithm for the two machine flow shop problem with several availability constraints, Minimizing the makespan for the flow shop scheduling problem with availability constraints., Scheduling with limited machine availability, A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach, The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis, A PTAS for a particular case of the two-machine flow shop with limited machine availability, Integrated production planning and preventive maintenance in deteriorating production systems, Approximation results for flow shop scheduling problems with machine availability constraints, A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints, A market-based multi-agent system model for decentralized multi-project scheduling, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint, Scheduling two-stage hybrid flow shop with availability constraints, Two-machine open shop scheduling with an availability constraint, Flow shops with machine maintenance: ordered and proportionate cases, Two-machine flow shop and open shop scheduling problems with a single maintenance window, Two-machine flow shop scheduling integrated with preventive maintenance planning, Approximation results for the two-machine job shop under limited machine availability, A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints, Stability of Johnson's schedule with respect to limited machine availability, MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS, Exponential inapproximability and FPTAS for scheduling with availability constraints, Unnamed Item, Optimality of Jackson's permutations with respect to limited machine availability, Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times, Unnamed Item, Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Optimal two- and three-stage production schedules with setup times included
- Scheduling on semi-identical processors
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
