𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel machine scheduling with release dates, due dates and family setup times

✍ Scribed by J.M.J. Schutten; R.A.M. Leussink

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
471 KB
Volume
46-47
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Heuristic procedures for scheduling job
Heuristic procedures for scheduling job families with setups and due dates
✍ Kenneth R. Baker πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 261 KB πŸ‘ 1 views

This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in g

On scheduling with ready-times, due-date
On scheduling with ready-times, due-dates and vacations
✍ V. Jorge Leon; S. David Wu πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 711 KB

A single machine sequencing problem is considered in which there are ready-time and due-date constraints on jobs and vacation constraints on the machine. Each vacation has fixed starting and finish time and no preemption is allowed for the jobs. The objective is to minimize maximum lateness. An intr

Due-date assignment and single machine s
Due-date assignment and single machine scheduling with compressible processing times
✍ T.C.E. Cheng; C. OΗ§uz; X.D. Qi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 588 KB

In this paper we consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the