Parallel machine scheduling with time constraints on machine qualifications
DOI10.1016/j.cor.2019.03.004zbMath1458.90335OpenAlexW2921000597WikidataQ128223985 ScholiaQ128223985MaRDI QIDQ1738819
Cheng-Hung Wu, Stéphane Dauzère-Pérès, Margaux Nattaf, Claude Yugma
Publication date: 18 April 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.03.004
heuristicsinteger programmingschedulingparallel machinesconstraint programmingtime constraintsmachine qualifications
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Cites Work
- Optimization by Simulated Annealing
- A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
- Sequencing optimisation for makespan improvement at wet-etch tools
- Combined planning and scheduling in a divergent production system with co-production: a case study in the lumber industry
- Scheduling job families on non-identical parallel machines with time constraints
- A batch-oblivious approach for complex job-shop scheduling problems
- Constraint satisfaction problems: Algorithms and applications
- Integration of scheduling and advanced process control in semiconductor manufacturing: review and outlook
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Dynamic production control in a serial line with process queue time constraint
- On the importance of sequencing decisions in production planning and scheduling
This page was built for publication: Parallel machine scheduling with time constraints on machine qualifications