Open shop scheduling problems with late work criteria.

DOI10.1016/S0166-218X(03)00339-1zbMath1043.90026OpenAlexW2118724997WikidataQ57387795 ScholiaQ57387795MaRDI QIDQ1421458

Małgorzata Sterna, Frank Werner, Jacek Błażewicz, Erwin Pesch

Publication date: 26 January 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00339-1

zbMATH Keywords

Scheduling problemsproblemLate work criterionOpen-shopOptimality criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (19)

Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays ⋮ A new particle swarm optimization for multi-objective open shop scheduling ⋮ Two-machine flow-shop scheduling to minimize total late work: revisited ⋮ Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A note on the two machine job shop with the weighted late work criterion ⋮ A common approximation framework for early work, late work, and resource leveling problems ⋮ A no-delay single machine scheduling problem to minimize total weighted early and late work ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Two-machine open shop problem with controllable processing times ⋮ The two-machine flow-shop problem with weighted late work criterion and common due date ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Minimizing total weighted late work in the resource-constrained project scheduling problem ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing mean weighted execution time loss on identical and uniform processors
• Complexity results for scheduling chains on a single machine
• Approximation algorithms for scheduling a single machine to minimize total late work
• Scheduling shops to minimize the weighted number of late jobs
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Scheduling identical jobs on uniform parallel machines
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Single Machine Scheduling to Minimize Total Late Work
• Open Shop Scheduling to Minimize Finish Time
• Minimizing Maximum Weighted Error for Imprecise Computation Tasks

This page was built for publication: Open shop scheduling problems with late work criteria.