Scheduling on parallel identical machines with late work criterion: offline and online cases

DOI10.1007/s10951-015-0464-7zbMath1386.90050OpenAlexW2220526905WikidataQ57387695 ScholiaQ57387695MaRDI QIDQ1702733

Xin Han, Xin Chen, Jacek Błażewicz, Małgorzata Sterna

Publication date: 28 February 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-015-0464-7

zbMATH Keywords

competitive ratioNP-hardnessidentical parallel machinesonline and offline schedulinglate work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (23)

Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Two-machine flow-shop scheduling to minimize total late work: revisited ⋮ Semi-online early work maximization problem on two hierarchical machines with partial information of processing time ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A common approximation framework for early work, late work, and resource leveling problems ⋮ A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time ⋮ Exact approaches to late work scheduling on unrelated machines ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Dynamic scheduling of patients in emergency departments ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Online early work maximization on three hierarchical machines with a common due date ⋮ Online early work maximization problem on two hierarchical machines with buffer or rearrangements ⋮ Fair task allocation problem ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Mirror scheduling problems with early work and late work criteria ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works ⋮ A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Internet shopping with price sensitive discounts
• Minimizing mean weighted execution time loss on identical and uniform processors
• Dominance relations for two-machine flow shop problem with late work criterion
• Optimal algorithms for online scheduling with bounded rearrangement at the end
• A note on the two machine job shop with the weighted late work criterion
• Minimizing the number of tardy job units under release time constraints
• Online scheduling with reassignment
• Online algorithms. The state of the art
• Open shop scheduling problems with late work criteria.
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
• Online Minimum Makespan Scheduling with a Buffer
• The Power of Reordering for Online Minimum Makespan Scheduling
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
• Single Machine Scheduling to Minimize Total Late Work
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Single Machine Scheduling to Minimize Total Weighted Late Work
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• KI 2005: Advances in Artificial Intelligence

This page was built for publication: Scheduling on parallel identical machines with late work criterion: offline and online cases