Browse > Article
http://dx.doi.org/10.7232/iems.2011.10.1.001

Batch Scheduling Problem with Multiple Due-dates Constraints  

Mohri, Shintaro (Facluty of Economics, Kobegakuin University Kobe)
Masuda, Teruo (Faculty of Business Administration Tezukayama University Nara)
Ishii, Hiroaki (Faculty of Business Administration KwanseiGakuin University)
Publication Information
Industrial Engineering and Management Systems / v.10, no.1, 2011 , pp. 1-6 More about this Journal
Abstract
This paper describes the issue of batch scheduling.In food production, the lead-time from produc-tion to sale should be decreased becausefreshness of the product is important. Products are shipped at diverse times depending on a demand of sellers, because the types of sellers has become diversified such as super-markets, convenience stores and etc. production of quantity demanded must be completed by time to ship it then. The authors consider a problem with due-dates constraints and construct the algorithm to find the opti-mal schedule that satisfy the due-dates constraint, batch size constraint, inventory time constraint and mini-mize total flow time.
Keywords
Batch Scheduling; Dynamic Programming; Food Production;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Herrmann, J. W. and Lee, C.-Y. (1995), Solving a class scheduling problem with a genetic algorithm, ORSA Journal on Computing, 7, 443-452.   DOI
2 Mohri, S., (2007), Batch Scheduling Problem with duedates Constraints, Asia Pacific Management Review, 13, 129-132.
3 Monma, C. L. and Potts C. N. (1989), On the complexity of scheduling with batch setup times, Operations Research, 37, 798-804.   DOI   ScienceOn
4 Potts, C. N. and Kovalyov, M. Y. (2000), Scheduling with batching: A review, European Journal of Operational Research, 120, 228-249.   DOI   ScienceOn
5 Potts, C. N. and Van Wassenhove, L. N. (1992), Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity, Journal of Operational Research Society, 51, 199-209.