✦ LIBER ✦

Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration

✍ Scribed by Yau-Ren Shiau; Wen-Chiung Lee; Chin-Chia Wu; Chia-Ming Chang

Publisher: Springer
Year: 2006
Tongue: English
Weight: 188 KB
Volume: 34
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-006-0646-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-machine scheduling with simple li

Single-machine scheduling with simple linear deterioration to minimize earliness penalties

✍ Dan Wang; Ji-Bo Wang 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 225 KB

Flow shop scheduling with deteriorating

Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan

✍ Ji-Bo Wang 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 233 KB

Schedule of n jobs on two identical mach

Schedule of n jobs on two identical machines to minimize weighted mean flow time

✍ Bahram Alidaee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Heuristics for the two-machine flowshop

Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times

✍ Ali Allahverdi; Harun Aydilek 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Scheduling resumable simple linear deter

Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

✍ Min Ji; T.C.E. Cheng 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB

## a b s t r a c t We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. Th

Scheduling on M parallel machines subjec

Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time

✍ Ali Allahverdi; John Mittenthal 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 1 views