Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays

DOI10.1016/j.apm.2014.01.006zbMath1428.90064OpenAlexW2050819356MaRDI QIDQ1631999

Y. Aharonov

Publication date: 12 December 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2014.01.006

zbMATH Keywords

branch-and-bound algorithmschedulingparallel processorscommunication delay

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work ⋮ Exact approaches to late work scheduling on unrelated machines ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ 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

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A note on the two machine job shop with the weighted late work criterion
• Multiprocessor scheduling with communication delays
• Scheduling for parallel processing
• Approximation algorithms for scheduling a single machine to minimize total late work
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Open shop scheduling problems with late work criteria.
• Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
• Scheduling with Deadlines and Loss Functions
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• 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
• A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times

This page was built for publication: Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays