✦ LIBER ✦

Remarks on the makespan minimization problem

✍ Scribed by Michael A. Langston

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 109 KB
Volume: 8
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(84)90011-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Makespan minimization in the two-machine

Makespan minimization in the two-machine flowshop batch scheduling problem

✍ T.C.E. Cheng; B.M.T. Lin; A. Toker 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 2 views

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part-types are to be produced in a flexible manufacturing cell organized into a two-stage production line. The jobs are processed in batches on the first

Solving makespan minimization problems w

Solving makespan minimization problems with Lagrangean decomposition

✍ Monique Guignard 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 631 KB

Minimizing makespan in a multimode multi

Minimizing makespan in a multimode multiprocessor shop scheduling problem

✍ Lucio Bianco; Paolo Dell'Olmo; Stefano Giordani; Maria Grazia Speranza 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing

Minimization of the makespan in a two-ma

Minimization of the makespan in a two-machine problem under given resource constraints

✍ Adam Janiak 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 163 KB

In the paper the classical two-machine ¯ow-shop problem was generalized to the case when job processing times may be reduced linearly by the application of a limited, continuously divisible resource, e.g. ®nancial outlay, energy, fuel, catalyzer etc. It is proved that the decision form of this probl

Minimizing the makespan of a group sched

Minimizing the makespan of a group scheduling problem: a new heuristic

✍ Rasaratnam Logendran; Nudtapon Nudtasomboon 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

The complexity of makespan minimization

The complexity of makespan minimization for pipeline transportation

✍ Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 254 KB

SPTP is a model for the pipeline transportation of petroleum products. It uses a directed graph G, where arcs represent pipes and nodes represent locations. In this paper, we analyze the complexity of ÿnding a minimum makespan solution to SPTP. This problem is called SPTMP. We prove that, for any ÿx