✦ LIBER ✦

Sequencing jobs on a non-Markovian machine with random disruptions

✍ Scribed by Aytuğ, Haldun; Paul, Anand

Book ID: 118740938
Publisher: Taylor and Francis Group
Year: 2012
Tongue: English
Weight: 178 KB
Volume: 44
Category: Article
ISSN: 0740-817X
DOI: 10.1080/0740817X.2011.635183

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Job selection and sequencing on a single

Job selection and sequencing on a single machine in a random environment

✍ Prabuddha De; Jay B. Ghosh; Charles E. Wells 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Optimal assignment of slack due-dates an

Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine

✍ T.C.E. Cheng 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Sequencing jobs on a single machine with

Sequencing jobs on a single machine with a common due date and stochastic processing times

✍ Subhash C. Sarin; Erdal Erel; George Steiner 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 561 KB

A procedure for the one-machine sequenci

A procedure for the one-machine sequencing problem with dependent jobs

✍ Stéphane Dauzère-Pérès 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 650 KB

The open shop scheduling problem with a

The open shop scheduling problem with a given sequence of jobs on one machine

✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

A HEURISTIC ALGORITHM FOR THE FLOWSHOP P

A HEURISTIC ALGORITHM FOR THE FLOWSHOP PROBLEM WITH A COMMON JOB SEQUENCE ON ALL MACHINES

✍ Sumer C. Aggarwal; Edward Stafford 📂 Article 📅 1975 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 682 KB