Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods

DOI10.1111/ITOR.12589MaRDI QIDQ6090983zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

identical parallel machineslist schedulingabsolute performance boundresource unavailability

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Approximation algorithms for scheduling with reservations
• Approximation schemes for parallel machine scheduling with availability constraints
• Bi-objective ant colony optimization approach to optimize production and maintenance scheduling
• Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
• Bounds on Multiprocessing Timing Anomalies
• Handbook on Scheduling
• Machine scheduling with availability constraints
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
• Optimal parallel machines scheduling with availability constraints
• Parallel machines scheduling with machine maintenance for minsum criteria
• Parallel machines scheduling with nonsimultaneous machine available time
• Parallel-machine scheduling with non-simultaneous machine available time
• Scheduling with deadlines and loss functions
• Scheduling with tool changes to minimize total completion time under controllable machining conditions
• Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
• Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
• Tight bounds for the identical parallel machine scheduling problem
• Tight bounds for the identical parallel machine‐scheduling problem: Part II

Cited in

(3)

• List scheduling algorithms to minimize the makespan on identical parallel machines
• List Scheduling in Order of α-Points on a Single Machine
• Coordination mechanisms for scheduling games with machine modification

This page was built for publication: Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods

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