✦ LIBER ✦

A two-stage semi-hybrid flowshop problem in graphics processing

✍ Scribed by Wei Qi; He Yong

Book ID: 107500714
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2005
Tongue: English
Weight: 369 KB
Volume: 20
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-005-0016-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A two-stage hybrid flowshop scheduling p

A two-stage hybrid flowshop scheduling problem in machine breakdown condition

✍ M. Mirabi, S. M. T. Fatemi Ghomi, F. Jolai 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 175 KB

A two-stage hybrid flowshop scheduling p

A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines

✍ Chinyao Low; Chou-Jung Hsu; Chwen-Tzeng Su 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 156 KB

A hybrid two-stage flexible flowshop sch

A hybrid two-stage flexible flowshop scheduling problem withmidentical parallel machines and a burn-in processor separately

✍ Long-min He; Shi-jie Sun 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 205 KB

A heuristic for scheduling in a two-stag

A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages

✍ Figielska, Ewa 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 698 KB

The optimal number of used machines in a

The optimal number of used machines in a two-stage flexible flowshop scheduling problem

✍ Gerstl, Enrique; Mosheiov, Gur 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 522 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