𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling with agreeable release times and due dates on a batch processing machine

✍ Scribed by Chung-Lun Li; Chung-Yee Lee

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
431 KB
Volume
96
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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