A three-machine permutation flow-shop problem with minimum makespan on the second machine

In this paper, we consider a three-machine permutation flow-shop scheduling problem where the criterion is to minimize the total completion time without idle times subject to the minimum makespan on the second machine. This problem is NP-hard while each of the objective functions alone can be optimi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	The Journal of the Operational Research Society Ročník 57; číslo 4; s. 460 - 468
Hlavní autori:	Yanai, S, Fujie, T
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basingstoke Taylor & Francis 01.04.2006 Palgrave Macmillan Press Palgrave Taylor & Francis Ltd
Predmet:	Algorithms Applied sciences branch-and-bound algorithm Exact sciences and technology Experiments flow-shop scheduling Heuristics hierarchical criteria Integer programming Integers Job shops Manufacturing Mathematical permutation Mathematical programming multicriteria scheduling Objective functions Operational research and scientific management Operational research. Management science Operations research Optimal solutions Polynomials Production scheduling Ratios Schedules Scheduling Scheduling, sequencing Simulated annealing Studies Theoretical Papers Branching hierarchical criteria Multicriteria analysis Branch and bound method Permutation Dominance Mixed integer programming Scheduling Makespan Polynomial time multicriteria scheduling Minimum time flow-shop scheduling branch-and-bound algorithm NP hard problem Flow shop Objective function Completion time
ISSN:	0160-5682, 1476-9360
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!