✦ LIBER ✦

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

✍ Scribed by Pei Chann Chang; Shih Hsin Chen; V. Mani

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 257 KB
Volume: 33
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2008.01.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 computerized algorithm for scheduling

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

✍ R. Meenakshi Sundaram; Wen-shiom Lian 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 337 KB

A hybrid simulated annealing approach fo

A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions

✍ John Mittenthal; Madabhushi Raghavachari; Arif I. Rana 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 853 KB

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

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB