Open shop scheduling problems with late work criteria

Authors:
Jacek Błażewicz;Erwin Pesch;Małgorzata Sterna;Frank Werner
Affiliations:
Institute of Computing Science, Poznan University of Technology, Piotrowo 3A, 60-965 Poznan, Poland;Institute of Information Systems, FB 5 - Faculty of Economics, University of Siegen, Hölderlinstr. 3, 57068 Siegen, Germany;Institute of Computing Science, Poznan University of Technology, Piotrowo 3A, 60-965 Poznan, Poland;Faculty of Mathematics, Otto-von-Guericke-University, PSF 4120, 39016 Magdeburg, Germany
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 9
Cited 7

Minimizing mean weighted execution time loss on identical and uniform processors

Information Processing Letters
Algorithms for scheduling imprecise computations with timing constraints

SIAM Journal on Computing
Single machine scheduling to minimize total late work

Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Minimizing maximum weighted error for imprecise computation tasks

Journal of Algorithms
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Scheduling Algorithms

Scheduling Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes

A comparison of solution procedures for two-machine flow shop scheduling with late work criterion

Computers and Industrial Engineering
Late work minimization in a small flexible manufacturing system

Computers and Industrial Engineering
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date

Computers and Operations Research
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion

Computers and Industrial Engineering
Late work minimization in flow shops by a genetic algorithm

Computers and Industrial Engineering
Metaheuristics for late work minimization in two-machine flow shop with common due date

KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Two-machine open shop problem with controllable processing times

Discrete Optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

The paper concerns the application of a non-classical performance measure, a late work criterion (Y, Yw), to scheduling problems. It estimates the quality of the obtained solution with regard to the duration of the late parts of tasks not taking into account the quantity of this delay. The paper provides the formal definition of the late work parameter, especially in the shop environment, together with its practical motivation. It contains general complexity studies and the results of investigating open-shop scheduling cases, i.e. two polynomial time algorithms for problems O | pmtn, ri | Yw and O2 | di = d | Y, as well as the binary NP-hardness proof for O2 | di = d | Yw.