✦ LIBER ✦

Discrete-continuous scheduling problems — Mean completion time results

✍ Scribed by Joanna Józefowska; Jan Wȩglarz

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 516 KB
Volume: 94
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(96)00130-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the discrete-continuous project

Solving the discrete-continuous project scheduling problem via its discretization

✍ Joanna Józefowska; Marek Mika; Rafał Różycki; Grzegorz Waligóra; Jan Weglarz 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 88 KB

Method for solving one discrete-time sch

Method for solving one discrete-time scheduling problem

✍ Yu. P. Rudnev 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 502 KB

Three scheduling problems with deteriora

Three scheduling problems with deteriorating jobs to minimize the total completion time

✍ C.T. Ng; T.C.E. Cheng; A. Bachman; A. Janiak 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 84 KB

In this paper, three scheduling problems with deteriorating jobs to minimize the total completion time on a single machine are investigated. By a deteriorating job, we mean that the processing time of the job is a function of its execution start time. The three problems correspond to three different

The two-stage assembly flowshop scheduli

The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time

✍ Ali Allahverdi; Fawaz S. Al-Anzi 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 235 KB

Relation between continuous and discrete

Relation between continuous and discrete time markovian decision problems

✍ Prasadarao Kakumanu 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 471 KB

The complexity of mean flow time schedul

The complexity of mean flow time scheduling problems with release times

✍ Philippe Baptiste; Peter Brucker; Marek Chrobak; Christoph Dürr; Svetlana A. Kra 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 396 KB