𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for single machine scheduling with one unavailability period

✍ Scribed by Imed Kacem; Mohamed Haouari

Publisher
Springer
Year
2008
Tongue
English
Weight
254 KB
Volume
7
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An FPTAS for scheduling a two-machine fl
An FPTAS for scheduling a two-machine flowshop with one unavailability interval
✍ C.T. Ng; Mikhail Y. Kovalyov πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 87 KB

## Abstract We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. Th

Scheduling grouped jobs on single machin
Scheduling grouped jobs on single machine with genetic algorithm
✍ Dingwei Wang; Mitsuo Gen; Runwwei Cheng πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 176 KB

Production scheduling of grouped jobs has been an active research area since GT (Group Technology) was widely applied in practical manufacturing systems. To minimize the total Β―owtime of grouped jobs on a single machine, we combine jobs into fundamental runs based upon the necessary condition of the