✦ LIBER ✦

Scheduling jobs within time windows on identical parallel machines: New model and algorithms

✍ Scribed by Virginie Gabrel

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 764 KB
Volume: 83
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00010-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling identical jobs on uniform par

Scheduling identical jobs on uniform parallel machines with random processing times

✍ Mohamed I. Dessouky; Richard L. Marcellus; Li Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 261 KB

For the problem of scheduing identical jobs on a set of uniform parallel machines with random processing times, methods are given for optimizing the expected sum of weighted completion times and the probability of meeting a common due date.

A branch-and-price algorithm for paralle

A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities

✍ Jonathan F. Bard; Siwate Rojanasoonthon 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

## Abstract This paper presents a branch‐and‐price algorithm for scheduling __n__ jobs on __m__ nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of __ρ__ priority classes and may require two operations. The objective i

Exact algorithms for scheduling multiple

Exact algorithms for scheduling multiple families of jobs on parallel machines

✍ Zhi-Long Chen; Warren B. Powell 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o

Scheduling identical jobs with unequal r

Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness

✍ Maged M. Dessouky 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 308 KB

AbstractÐWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that

Approximation algorithms for minimizing

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

✍ Joseph Y-T. Leung; Haibing Li; Michael Pinedo 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re