𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Strong NP-hardness of the single machine
✍ C.T. Ng; T.C.E. Cheng; J.J. Yuan πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 58 KB

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

A scheduling problem in a semi-open job
✍ A.S. Alfa; K.L. Dolhun; C.-L. Li πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 606 KB

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

Social learning for solving complex prob
✍ S. Van Bommel; N. RΓΆling; N. Aarts; E. Turnhout πŸ“‚ Article πŸ“… 2009 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 319 KB πŸ‘ 2 views

## 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