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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of production economics Ročník 136; číslo 1; s. 67 - 74
Hlavní autoři:	Shabtay, Dvir, Bensoussan, Yaron, Kaspi, Moshe
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.03.2012 Elsevier Sequoia S.A
Témata:	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
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!

Buďte první, kdo okomentuje tento záznam!