𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Priority algorithms for makespan minimization in the subset model

✍ Scribed by Oded Regev

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
63 KB
Volume
84
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved part grouping model for mini
An improved part grouping model for minimizing makespan in FMS
✍ Zubair M. Mohamed; Ashok Kumar; Jaideep Motwani πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 139 KB

In some Β―exible manufacturing systems (FMSs), limited tool magazine capacity requires grouping of parts into subsets for production. Although several studies have addressed the part grouping issue, research comparing the performance of models is scanty. Moreover, there is no congruency in the object

A hybrid algorithm for finding minimal u
A hybrid algorithm for finding minimal unsatisfiable subsets in over-constrained CSPs
✍ I. Shah πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 619 KB

Minimal Unsatisfiable Subsets (MUSes) are the subsets of constraints of an overconstrained constraint satisfaction problem (CSP) that cannot be satisfied simultaneously and therefore are responsible for the conflict in the CSP. In this paper, we present a hybrid algorithm for finding MUSes in overco

Job sequencing rules for minimizing the
Job sequencing rules for minimizing the expected makespan in flexible machines
✍ Amiya K. Chakravarty; Nagraj Balakrishnan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 863 KB

We consider scheduling of a deteriorating flexible machine that is capable of processing a number of diverse jobs with negligible setup times between jobs. Specifically, we develop rules for sequencing N jobs on such a machine such that its expected makespan (sum of all job processing times and mach

Fast algorithms to minimize the makespan
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times
✍ Jinliang Cheng; George Steiner; Paul Stephenson πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 186 KB πŸ‘ 2 views

We consider the two-machine ow-shop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a uniΓΏed treatment of various sequenceinterchange operators and derive powerful new dominance orders, which are incorporated into branchand-bound