A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system

We analyze a two-machine flow-shop scheduling problem in which the job processing times are controllable by the allocation of resources to the job operations and the resources can be used in discrete quantities. We provide a bicriteria analysis of the problem where the first criterion is to maximize...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of production economics Jg. 136; H. 1; S. 67 - 74
Hauptverfasser:	Shabtay, Dvir, Bensoussan, Yaron, Kaspi, Moshe
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.03.2012 Elsevier Sequoia S.A
Schlagworte:	Algorithms Allocations Approximation Controllable processing times Cost engineering Criteria Flow shop FPTAS Job shops Just in time Just-in-time scheduling Mathematical analysis Operations research Pareto optimum Production scheduling Pseudo-polynomial time algorithm Resource allocation Resource scheduling Scheduling Studies Just-in-time scheduling Flow shop FPTAS Controllable processing times Resource allocation Pseudo-polynomial time algorithm
ISSN:	0925-5273, 1873-7579
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!