Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem

This paper considers the problem of minimizing the weighted number of late jobs in the two-machine job-shop with unit time operations. We show its NP-hardness and propose an O( n 5∑ w i ) time algorithm, which is based on solving optimally a related problem where a maximal set of early jobs is to be...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 98; číslo 3; s. 209 - 217
Hlavní autor: Kravchenko, Svetlana A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Lausanne Elsevier B.V 15.01.2000
Amsterdam Elsevier
New York, NY
Témata:
Applied sciences
Exact sciences and technology
Job-shop
Mathematical programming
NP-hard problem
Operational research and scientific management
Operational research. Management science
Pseudo-polynomial algorithm
Scheduling, sequencing
Pseudo-polynomial algorithm
Job-shop
NP-hard problem
Two machine job shop
Job shop
NP hard problem
Scheduling
Algorithm
Optimization
Polynomial time
ISSN:0166-218X, 1872-6771
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper considers the problem of minimizing the weighted number of late jobs in the two-machine job-shop with unit time operations. We show its NP-hardness and propose an O( n 5∑ w i ) time algorithm, which is based on solving optimally a related problem where a maximal set of early jobs is to be determined.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(99)00165-1