Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods
From MaRDI portal
Publication:6090983
DOI10.1111/itor.12589OpenAlexW2889449888MaRDI QIDQ6090983
Unnamed Author, Unnamed Author, Amine Mahjoub
Publication date: 21 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12589
Related Items
Cites Work
- Unnamed Item
- Parallel machines scheduling with machine maintenance for minsum criteria
- Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
- Approximation schemes for parallel machine scheduling with availability constraints
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
- Parallel machines scheduling with nonsimultaneous machine available time
- Scheduling with tool changes to minimize total completion time under controllable machining conditions
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Machine scheduling with availability constraints
- Parallel-machine scheduling with non-simultaneous machine available time
- Optimal parallel machines scheduling with availability constraints
- Bi-objective ant colony optimization approach to optimize production and maintenance scheduling
- Scheduling with Deadlines and Loss Functions
- Tight bounds for the identical parallel machine scheduling problem
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
- Bounds on Multiprocessing Timing Anomalies
- Handbook on Scheduling
- Approximation algorithms for scheduling with reservations
