✦ LIBER ✦

Two parallel machine sequencing problems involving controllable job processing times

✍ Scribed by Bahram Alidaee; Ahmad Ahmadian

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 403 KB
Volume: 70
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)90245-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A two-machine flow shop scheduling probl

A two-machine flow shop scheduling problem with controllable job processing times

✍ Eugeniusz Nowicki; Stanisław Zdrzałka 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 639 KB

Sequencing n jobs on two machines with s

Sequencing n jobs on two machines with setup, processing and removal times separated

✍ Dileep R. Sule 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

A generalized two-machine flowshop sched

A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time

✍ Dar-Li Yang; Maw-Sheng Chern 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We consider a two-machine ¯owshop scheduling problem where the processing times are linearly dependent on the waiting times of the jobs. The objective is to minimize the makespan. A 0±1 mixed integer program and a heuristic algorithm are proposed. Some cases solved in polynomial time and computation