Online early work scheduling on parallel machines

DOI10.1016/J.EJOR.2024.01.009MaRDI QIDQ6586214zbMATH OpenFDO

Authors Yiwei Jiang, Mengjing Wu, Xin Chen, Jianming Dong, T. C. Edwin Cheng, Jacek Blazewicz, Min Ji

Publication date 13 August 2024

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2024.01.009

zbMATH Keywords

combinatorial optimizationcompetitive ratioearly workonline algorithmparallel-machine scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A common approximation framework for early work, late work, and resource leveling problems
• Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
• Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
• Bounds for Certain Multiprocessing Anomalies
• Competitive algorithm for scheduling of sharing machines with rental discount
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• scientific article; zbMATH DE number 3902030 (Why is no real title available?)
• scientific article; zbMATH DE number 1445351 (Why is no real title available?)
• Machine covering in the random-order model
• Minimizing total late work on a single machine with generalized due-dates
• Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
• On-line scheduling revisited
• Online cardinality constrained scheduling
• Online load balancing on uniform machines with limited migration
• Online scheduling of ordered flow shops
• Online scheduling on parallel machines: a survey
• Open shop scheduling problems with late work criteria.
• Parallel solutions for preemptive makespan scheduling on two identical machines
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
• 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
• Semi-online scheduling on two identical machines with a common due date to maximize total early work
• Semi-online scheduling: a survey
• Single Machine Scheduling to Minimize Total Late Work
• Single machine scheduling with assignable due dates to minimize maximum and total late work

Cited in

(3)

• Scheduling with assignable due dates, two competing agents and late work related criteria
• Scheduling with a discounted profit criterion on identical machines
• The fourth comprehensive review of scheduling problems with setup times

This page was built for publication: Online early work scheduling on parallel machines

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