✦ LIBER ✦

A note on the complexity of the problem of two-agent scheduling on a single machine

✍ Scribed by C. T. Ng; T. C. E. Cheng; J. J. Yuan

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 267 KB
Volume: 12
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-006-9001-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on: ‘A unified formulation of the

A note on: ‘A unified formulation of the machine scheduling problem’

✍ A.H. Land; G. Laporte; P. Miliotis 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 58 KB

Two-agent group scheduling with deterior

Two-agent group scheduling with deteriorating jobs on a single machine

✍ Peng Liu; Lixin Tang; Xiaoye Zhou 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 206 KB

On the complexity of bi-criteria schedul

On the complexity of bi-criteria scheduling on a single batch processing machine

✍ L. L. Liu; C. T. Ng; T. C. E. Cheng 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 326 KB

A note on single-machine scheduling prob

A note on single-machine scheduling problems with the effects of deterioration and learning

✍ Li-Yan Wang; En-Min Feng 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 227 KB

A note on the complexity of single-machi

A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs

✍ Jinjiang Yuan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 119 KB

A note on “Beam search heuristics for th

A note on “Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”

✍ F. Della Croce; E. Desmier; T. Garaix 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 171 KB

In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time" ', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earlinesstard