✦ LIBER ✦

A single machine scheduling problem with availability constraints and sequence-dependent setup costs

✍ Scribed by Francisco Ángel-Bello; Ada Álvarez; Joaquín Pacheco; Iris Martínez

Book ID: 108057150
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 246 KB
Volume: 35
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2010.11.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-machine scheduling problems with

Single-machine scheduling problems with past-sequence-dependent setup times

✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 127 KB

A grasp for single machine scheduling wi

A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties

✍ Thomas A. Feo; Kishore Sarathy; John McGahan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 812 KB

A hybrid genetic algorithm for the singl

A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times

✍ A. Sioud; M. Gravel; C. Gagné 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 846 KB

The discrete lot-sizing and scheduling p

The discrete lot-sizing and scheduling problem with sequence-dependent setup costs

✍ Bernhard Fleischmann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 714 KB

A two-stage heuristic for single machine

A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs

✍ Ik-Soo Shim; Hyeok-Chol Kim; Hyoung-Ho Doh; Dong-Ho Lee 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 938 KB

Single machine scheduling with past-sequ

Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

✍ Chuanli Zhao; Hengyong Tang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 180 KB

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by func