The just-in-time scheduling problem in a flow-shop scheduling system

► We study several variants of the problem of maximizing the weighted number of JIT jobs in a flow-shop scheduling system. ► We show that the unweighted version of the problem on two machines is solvable in O( n 3) time. ► We show that the problem is ordinary NP-hard even if the processing times are...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 216; H. 3; S. 521 - 532
1. Verfasser:	Shabtay, Dvir
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.02.2012 Elsevier Elsevier Sequoia S.A
Schlagworte:	Algorithms Applied sciences Approximation Complexity Customers Exact sciences and technology Flow-shop Gain Inventory control, production control. Distribution Job shops Just in time Just-in-time scheduling Mathematical analysis Mathematical programming No-wait restriction Operational research Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Production scheduling Pseudo-polynomial time algorithm Scheduling Scheduling, sequencing Studies Just-in-time scheduling No-wait restriction Flow-shop Pseudo-polynomial time algorithm Complexity Script Multiple machine Polynomial approximation Job shop Processing time Scheduling Polynomial method Approximation algorithm Real time Polynomial time Just in time NP hard problem Flow shop Time complexity Execution time
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!