𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

✍ Scribed by Gur Mosheiov; Daniel Oron

Book ID
113553763
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
121 KB
Volume
39
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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