✦ LIBER ✦

A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times

✍ Scribed by Toshio Hamada and Kevin D. Glazebrook

Book ID: 123687631
Publisher: INFORMS
Year: 1993
Tongue: English
Weight: 406 KB
Volume: 41
Category: Article
ISSN: 0030-364X
DOI: 10.2307/171655

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A single-machine, single-wafer-processin

A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times

✍ Subhash C. Sarin; Lixin Wang; Ming Cheng 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Scheduling jobs with release times preem

Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

✍ Nodari Vakhania 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 910 KB

Single machine scheduling to minimize we

Single machine scheduling to minimize weighted sum of completion times with secondary criterion — A branch and bound approach

✍ S.P. Bansal 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 592 KB

Fabrication scheduling on a single machi

Fabrication scheduling on a single machine to minimize the weighted sum of product completion time

✍ Yu-qing Wang; Shi-jie Sun 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 204 KB

Properties of optimal schedules for the

Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine

✍ A. A. Lazarev; A. G. Kvaratskhelia 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 202 KB

Polynomial time algorithms for minimizin

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t