✦ LIBER ✦

A minimax job completion-time problem revisited

✍ Scribed by Moshe Sniedovich

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 198 KB
Volume: 1
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(88)90070-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiple period repair kit problem with

Multiple period repair kit problem with a job completion criterion: A case study

✍ D. Heeremans; L.F. Gelders 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 670 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

Minimizing total completion time on a ba

Minimizing total completion time on a batch processing machine with job families

✍ Vijaya Chandru; Chung-Yee Lee; Reha Uzsoy 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 420 KB

A tight lower bound for the completion t

A tight lower bound for the completion time variance problem

✍ C.T. Ng; X. Cai; T.C.E. Cheng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB

On A Scheduling Problem of Time Deterior

On A Scheduling Problem of Time Deteriorating Jobs

✍ Jin-Yi Cai; Pu Cai; Yixin Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 313 KB

Strong NP-hardness of the single machine

Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem

✍ C.T. Ng; T.C.E. Cheng; J.J. Yuan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 58 KB

We consider the single machine multi-operation jobs total completion time scheduling problem. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a set-up time. A job completes w