Single machine batch scheduling problem with family setup times and release dates to minimize makespan

@article{Yuan2006SingleMB,
  title={Single machine batch scheduling problem with family setup times and release dates to minimize makespan},
  author={J. J. Yuan and Zhaohui Liu and C. T. Ng and T. C. Edwin Cheng},
  journal={J. Scheduling},
  year={2006},
  volume={9},
  pages={499-513}
}
In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an O ( n ( n m + 1 )m) time dynamic programming algorithm and an O(mkP 2k−1) time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of distinct release dates and P is the sum of the setup times of all the families and the processing… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

Scheduling batches in flowshop with limited buffers in the shampoo industry

European Journal of Operational Research • 2012
View 7 Excerpts
Highly Influenced

Scheduling a single machine with job family setup times to minimize total tardiness

2017 International Conference on Engineering, Technology and Innovation (ICE/ITMC) • 2017
View 1 Excerpt

A scheduling model and complexity proof for autonomous vehicle sequencing problem at isolated intersections

Proceedings of 2014 IEEE International Conference on Service Operations and Logistics, and Informatics • 2014

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Similar Papers

Loading similar papers…