𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-price algorithm for the general case of scheduling parallel machines with a single server

✍ Scribed by Heng-Soon Gan; Andrew Wirth; Amir Abdekhodaee

Book ID
113553800
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
228 KB
Volume
39
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scheduling for parallel dedicated machin
Scheduling for parallel dedicated machines with a single server
✍ Celia A. Glass; Yakov M. Shafransky; Vitaly A. Strusevich πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 443 KB πŸ‘ 1 views

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two paralle

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

A branch and bound algorithm for single
A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
✍ Theodore G. Voutsinas; Costas P. Pappis πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 365 KB

Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the