Complexity of the job insertion problem in multi-stage scheduling
β Scribed by Arjen P.A. Vestjens; Marc Wennink; Gerhard J. Woeginger
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 127 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the single machine multi-operation jobs total completion time scheduling problem. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a set-up time. A job completes w
consider the scheduling of a cordset manufacturing process through several operations. The department is a semi-open job shop. The first and last operations are defined, but the remaining operations can be sequenced in a semi-flexible manner. We present a mixed-integer programming formulation of thi
## Abstract Social learning has been championed as a promising approach to address complex resource problems. According to theory, social learning requires several preβconditions to be met, including (1) a divergence of interests, (2) mutual interdependence and (3) the ability to communicate. This