✦ LIBER ✦

Minimizing total weighted completion time in a proportionate flow shop

✍ Scribed by Natalia Shakhlevich; Han Hoogeveen; Michael Pinedo

Publisher: Springer US
Year: 1998
Tongue: English
Weight: 127 KB
Volume: 1
Category: Article
ISSN: 1094-6136
DOI: 10.1002/(sici)1099-1425(1998100)1:3<157::aid-jos12>3.0.co;2-y

No coin nor oath required. For personal study only.

✦ Synopsis

We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to p H ; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n) time.

📜 SIMILAR VOLUMES

Heuristics for minimizing total weighted

Heuristics for minimizing total weighted tardiness in flexible flow shops

✍ Ya Yang; Stephan Kreipl; Michael Pinedo 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 156 KB 👁 1 views

Consider a #exible #ow shop with s stages in series and at each stage a number of identical machines in parallel. There are n jobs to be processed and each job has to go through the stages following the same route. Job j has release date r H , due date d H , weight w H and a processing time p HJ at

A large step random walk for minimizing

A large step random walk for minimizing total weighted tardiness in a job shop

✍ Stephan Kreipl 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 116 KB

We consider a job shop with m machines. There are n jobs and each job has a speciÿed sequence to be processed by the machines. Job j has release date rj, due date dj, weight wj and processing time pij on machine i (1; : : : ; m). The objective is to minimize the total weighted tardiness of the n job

A shifting bottleneck heuristic for mini

A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop

✍ Michael Pinedo; Marcos Singer 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single-machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem.