✦ LIBER ✦

A simulated annealing heuristic for scheduling in a flowshop with bicriteria

✍ Scribed by Rajesh Gangadharan; Chandrasekharan Rajendran

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 243 KB
Volume: 27
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(94)90337-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bicriteria flowshop scheduling with a

A bicriteria flowshop scheduling with a learning effect

✍ Tamer Eren; Ertan Güner 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Heuristics for scheduling in flowshop wi

Heuristics for scheduling in flowshop with multiple objectives

✍ Chandrasekharan Rajendran 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 807 KB

An evaluation of static flowshop schedul

An evaluation of static flowshop scheduling heuristics in dynamic flowshop models via a computer simulation

✍ Yang Byung Park 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 560 KB

Heuristic algorithm for scheduling in a

Heuristic algorithm for scheduling in a flowshop to minimize total flowtime

✍ Chandrasekharan Rajendran 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 624 KB

An efficient heuristic approach to the s

An efficient heuristic approach to the scheduling of jobs in a flowshop

✍ Chandrasekharan Rajendran; Dipak Chaudhuri 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 667 KB

Heuristic algorithms for preemptive sche

Heuristic algorithms for preemptive scheduling in a two-stage hybrid flowshop with additional renewable resources at each stage

✍ Ewa Figielska 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 464 KB

This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and renewable resources at both the stages. The resource requirements are of a 0-1 type. The objective is the minimization of makespan. The problem is NP-hard. Four heuristic algorithm