𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization

✍ Scribed by Seyda Topaloglu; Gamze Kilincli


Publisher
Springer
Year
2009
Tongue
English
Weight
281 KB
Volume
44
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A modified shifting bottleneck heuristic
✍ Scott J. Mason; John W. Fowler; W. Matthew Carlyle πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 138 KB

Increases in the demand for integrated circuits have highlighted the importance of meeting customer quality and on-time delivery expectations in the semiconductor industry. A modiΓΏed shifting bottleneck heuristic is developed for minimizing the total weighted tardiness in a semiconductor wafer fabri

A shifting bottleneck heuristic for mini
✍ Michael Pinedo; Marcos Singer πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 165 KB πŸ‘ 2 views

We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single-machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem.

A simulated annealing algorithm for the
✍ Atabak Elmi; Maghsud Solimanpur; Seyda Topaloglu; Afshin Elmi πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 444 KB

This paper addresses the problem of scheduling parts in job shop cellular manufacturing systems by considering exceptional parts that need to visit machines in different cells and reentrant parts which need to visit some machines more than once in non-consecutive manner. Initially, an integer linear