A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem

An O( n 2) algorithm is presented for the n jobs m parallel machines problem with identical processing times. Due dates for each job are given and the objective is the minimization of the number of late jobs. Preemption is permitted. The problem can be formulated as a maximum flow network model. The...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 165; no. 3; pp. 649 - 656
Main Authors:	Bornstein, Claudio Thomás, Alcoforado, Luciane Ferreira, Maculan, Nelson
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16-09-2005 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Applied sciences Combinatorial optimization Exact sciences and technology Flows in networks. Combinatorial problems Job shops Operational research and scientific management Operational research. Management science Operations research Optimization algorithms Parallel machines scheduling problem Preemptive scheduling Production scheduling Scheduling, sequencing Studies Preemptive scheduling Combinatorial optimization Parallel machines scheduling problem Flow models Network flow Parallel machines Processing time Scheduling Due date Directed graph Trust region method
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	An O( n 2) algorithm is presented for the n jobs m parallel machines problem with identical processing times. Due dates for each job are given and the objective is the minimization of the number of late jobs. Preemption is permitted. The problem can be formulated as a maximum flow network model. The optimality proof as well as other properties and a complete example are given.
ISSN:	0377-2217 1872-6860
DOI:	10.1016/j.ejor.2003.06.045