Open shop scheduling problems with late work criteria.

DOI10.1016/S0166-218X(03)00339-1MaRDI QIDQ1421458zbMATH OpenOpenAlexWikidataFDO

Authors Jacek Blazewicz, Małgorzata Sterna, Frank Werner, 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

problemLate work criterionScheduling problemsOpen-shopOptimality criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1594554
• A note on the two machine job shop with the weighted late work criterion
• scientific article; zbMATH DE number 1300389
• The two-machine flow-shop problem with weighted late work criterion and common due date
• A Note On The Complexity Of Openshop Scheduling Problems

Cites work

• scientific article; zbMATH DE number 1594554 (Why is no real title available?)
• scientific article; zbMATH DE number 1640601 (Why is no real title available?)
• scientific article; zbMATH DE number 3902030 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1196650 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Approximation algorithms for scheduling a single machine to minimize total late work
• Complexity results for scheduling chains on a single machine
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Minimizing Maximum Weighted Error for Imprecise Computation Tasks
• Minimizing mean weighted execution time loss on identical and uniform processors
• Network flows. Theory, algorithms, and applications.
• Open Shop Scheduling to Minimize Finish Time
• Operations scheduling with applications in manufacturing and services. With 3.5 disk package
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Scheduling identical jobs on uniform parallel machines
• Scheduling shops to minimize the weighted number of late jobs
• Single Machine Scheduling to Minimize Total Late Work

Cited in

(22)

• A new particle swarm optimization for multi-objective open shop scheduling
• Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
• A common approximation framework for early work, late work, and resource leveling problems
• Open shop scheduling with delays
• Semi-online scheduling on two identical machines with a common due date to maximize total early work
• A no-delay single machine scheduling problem to minimize total weighted early and late work
• Two-machine flow shop scheduling with a common due date to maximize total early work
• Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
• Online early work scheduling on parallel machines
• 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
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
• Two-machine open shop problem with controllable processing times
• Minimizing total weighted late work in the resource-constrained project scheduling problem
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• A note on the two machine job shop with the weighted late work criterion
• Single-machine scheduling with multi-agents to minimize total weighted late work
• Two-machine flow-shop scheduling to minimize total late work: revisited
• A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
• A two-agent single-machine scheduling problem with late work criteria
• scientific article; zbMATH DE number 1594554 (Why is no real title available?)

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

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