Heuristics for flow shop rescheduling with mixed blocking constraints
From MaRDI portal
Publication:6592920
DOI10.1007/s11750-023-00662-8zbMATH Open1546.90064MaRDI QIDQ6592920
Christophe Sauvey, Nathalie Sauer, Ayoub Tighazoui
Publication date: 26 August 2024
Published in: Top (Search for Journal in Brave)
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Improving schedule stability in single-machine rescheduling for new operation insertion
- Rescheduling for machine disruption to minimize makespan and maximum lateness
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- A dynamic scheduling approach for optimizing the material handling operations in a robotic cell
- Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
- A new rule for minimizing the number of tardy jobs in dynamic flow shops
- Heuristic methods for the single-machine scheduling problem with periodical resource constraints
- Dynamic programming approach for solving the open shop problem
- A new heuristic and an exact approach for a production planning problem
- Or in the industrial engineering of industry 4.0: experiences from the Iberian Peninsula mirrored in CJOR
- Stochastic radiotherapy appointment scheduling
- Rescheduling problems with allowing for the unexpected new jobs arrival
- Effects of OCRA parameters and learning rate on machine scheduling
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Complexity of flowshop scheduling problems with a new blocking constraint
- An anticipative scheduling approach with controllable processing times
- Predictive-reactive strategy for identical parallel machine rescheduling
- A robust optimization approach for the unrelated parallel machine scheduling problem
- Multi-project scheduling problem under shared multi-skill resource constraints
- Rescheduling for New Orders
- Parallel batching with multi-size jobs and incompatible job families
This page was built for publication: Heuristics for flow shop rescheduling with mixed blocking constraints