Multiple orders per job batch scheduling with incompatible jobs

@article{Erramilli2008MultipleOP,
  title={Multiple orders per job batch scheduling with incompatible jobs},
  author={Vishnu Erramilli and Scott J. Mason},
  journal={Annals of Operations Research},
  year={2008},
  volume={159},
  pages={245-260}
}
Abstract The multiple orders per job (MOJ) scheduling problem is presented for the batch-processing environment such as that exemplified by diffusion ovens. A mixed-integer programming formulation is presented for the incompatible job family case wherein only jobs that belong to the same family may be grouped together in a production batch. This optimization formulation is tested through an extensive experimental design with the objective of minimizing total weighted tardiness (maximizing on… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-7 OF 7 CITATIONS

Optimization models for the flow-shop scheduling problem with multiple orders per job

  • Jen-Shiang Chen
  • Computer Science
  • The 40th International Conference on Computers & Indutrial Engineering
  • 2010
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Scheduling multiple orders per job in a single machine to minimize total completion time

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES