✦ LIBER ✦

Parametric precedence relations in single machine scheduling

✍ Scribed by Wlodzimierz Szwarc

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 509 KB
Volume: 9
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(90)90053-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parametric precedence relations in singl

Parametric precedence relations in single machine scheduling

✍ Wlodzimierz Szwarc 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 27 KB

Single machine scheduling problem with f

Single machine scheduling problem with fuzzy precedence relation

✍ Hiroaki Ishii; Minoru Tada 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Single machine parallel batch scheduling

Single machine parallel batch scheduling subject to precedence constraints

✍ T.C.E. Cheng; C.T. Ng; J.J. Yuan; Z.H. Liu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

Single machine scheduling with decreasin

Single machine scheduling with decreasing linear deterioration under precedence constraints

✍ Ji-Bo Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 538 KB

This paper deals with single-machine scheduling problems with decreasing linear deterioration, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraints, respectively. I

Single machine scheduling with controlla

Single machine scheduling with controllable processing times: a parametric study

✍ In-Soo Lee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Optimal timing schedules in earliness-ta

Optimal timing schedules in earliness-tardiness single machine sequencing

✍ Wlodzimierz Szwarc; Samar K. Mukhopadhyay 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

The article deals with a single machine earliness-tardiness scheduling model where idle times are permitted in job processing. Based on a cluster concept we develop properties of the model that lead to a very fast algorithm to find an optimal timing schedule for a given sequence of jobs. The perform