Job Scheduling with Unfixed Availability Constraints

@inproceedings{Lau2004JobSW,
  title={Job Scheduling with Unfixed Availability Constraints},
  author={Hoong Chuin Lau and Chao Zhang},
  year={2004}
}
Standard scheduling theory assumes that all machines are continuously available throughout the planning horizon. In many manufacturing and service management situations however, machines need to be maintained periodically to prevent malfunctions. During the maintenance period, a machine is not available for processing jobs. Hence, a more realistic scheduling model should take into account machine maintenance activities. In this paper, we study the problem of job scheduling with unfixed… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Scheduling maintenance and semi-resumable jobs on a single machine

H GravesG., Lee C.-Y
Naval Research Logistics, • 1999
View 9 Excerpts
Highly Influenced

Minimizing the makespan in the two-machine no-wait flow-shop

M.-L. Espinouse, P. Formanowicz, B. Penz
Computers & Industrial Engineering, • 1999
View 1 Excerpt

Scheduling the maintenance on a single machine

X. Qi, T. Chen, F. Tu
J Oper Res Soc, • 1999
View 1 Excerpt

Two-machine flowshop scheduling with availability constraints

European Journal of Operational Research • 1999
View 1 Excerpt

Machine scheduling with an availability constraint

J. Global Optimization • 1996
View 3 Excerpts

Similar Papers

Loading similar papers…