Exact approaches to late work scheduling on unrelated machines

DOI10.34768/AMCS-2023-0021MaRDI QIDQ6093431zbMATH OpenOpenAlexFDO

Authors Xinbo Liu, Wen Wang, Xin Chen, Małgorzata Sterna, Jacek Blazewicz

Publication date 7 September 2023

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.34768/amcs-2023-0021

zbMATH Keywords

branch-and-bound algorithmdynamic programminglate work schedulingmathematical modelunrelated machines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Minimizing total tardiness in an unrelated parallel-machine scheduling problem
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines
• Single Machine Scheduling to Minimize Total Late Work
• Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
• Minimizing the number of late jobs on unrelated machines

Cites work

• A hybrid control strategy for a dynamic scheduling problem in transit networks
• A note on the two machine job shop with the weighted late work criterion
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
• scientific article; zbMATH DE number 3902030 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
• Mirror scheduling problems with early work and late work criteria
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• Scheduling problems with a common due window assignment: a survey
• Single Machine Scheduling to Minimize Total Late Work
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Two-machine flow shop scheduling with a common due date to maximize total early work

Cited in

(3)

• Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work
• New ideas in Lagrangian relaxation for a scheduling problem with the weighted tardiness criterion
• Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates

This page was built for publication: Exact approaches to late work scheduling on unrelated machines

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