𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

✍ Scribed by Graham McMahon and Michael Florian

Book ID
123686401
Publisher
INFORMS
Year
1975
Tongue
English
Weight
272 KB
Volume
23
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Note: Open-shop scheduling with release
Note: Open-shop scheduling with release dates to minimize maximum lateness
✍ Hans Kellerer; Thomas Tautenhahn; Gerhard Woeginger πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 295 KB πŸ‘ 2 views

We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness. 0 I995 John Wiley & Sons. Inc.

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

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