๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Makespan Minimization in Job Shops: A Linear Time Approximation Scheme

โœ Scribed by Jansen, Klaus; Solis-Oba, Roberto; Sviridenko, Maxim

Book ID
118198965
Publisher
Society for Industrial and Applied Mathematics
Year
2003
Tongue
English
Weight
167 KB
Volume
16
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A heuristic procedure for makespan minim
A heuristic procedure for makespan minimization in job shops with multiple identical processors
โœ Dileep R. Sule; Karthick Vijayasundaram ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 364 KB

Scheduling has been and continues to be a major issue in production planning. Job shop scheduling is one area where a considerable amount of research has been and continues to be pursued. Usual emphasis is on one machine per work center job shop scheduling. There appears to be very limited literatur