✦ LIBER ✦

Heuristics for scheduling in flowshop with multiple objectives

✍ Scribed by Chandrasekharan Rajendran

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 807 KB
Volume: 82
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)e0212-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simulated annealing heuristic for sche

A simulated annealing heuristic for scheduling in a flowshop with bicriteria

✍ Rajesh Gangadharan; Chandrasekharan Rajendran 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Heuristic algorithms for scheduling in t

Heuristic algorithms for scheduling in the no-wait flowshop

✍ Rajesh Gangadharan; Chandrasekharan Rajendran 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Geometrical heuristics for multiprocesso

Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage

✍ S. V. Sevastianov 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 185 KB

Heuristics for two-machine no-wait flows

Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

✍ Guoqing Wang; T.C.Edwin Cheng 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 75 KB

In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a w

Deterministic multiprocessor scheduling

Deterministic multiprocessor scheduling with multiple objectives

✍ Sheldon Epstein; Yonah Wilamowsky; Bernard Dickman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 720 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