✦ LIBER ✦

A computerized algorithm for scheduling dependent jobs with weights in a single machine

✍ Scribed by R. Meenakshi Sundaram; Wen-shiom Lian

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 337 KB
Volume: 19
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(90)90068-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for single

A branch and bound algorithm for single machine scheduling with deteriorating values of jobs

✍ Theodore G. Voutsinas; Costas P. Pappis 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the

A hybrid genetic algorithm with dominanc

A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties

✍ Pei Chann Chang; Shih Hsin Chen; V. Mani 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A note on single-machine scheduling with

A note on single-machine scheduling with decreasing time-dependent job processing times

✍ Ji-Bo Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 175 KB

A look-ahead heuristic for scheduling jo

A look-ahead heuristic for scheduling jobs with release dates on a single machine

✍ Weizhen Mao; Rex K. Kincaid 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 908 KB

The complexity of machine scheduling for

The complexity of machine scheduling for stability with a single disrupted job

✍ Roel Leus; Willy Herroelen 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Minimum number of tardy jobs in single m

Minimum number of tardy jobs in single machine scheduling with release dates—an improved algorithm

✍ Thuruthickara C. John; Yih-Bor Wu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 352 KB