Lot sizing, delivery and scheduling of identical jobs in a single-stage supply chain

International Journal of Innovative Computing, Information and Control

Volumn 6, Issue 8, 2010, Pages 3657-3668

  Grunder, Olivier ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE BELFORT MONTBÉLIARD   (France)

Author keywords

Batch scheduling; Capacitated lot sizing; Dynamic programming; Production planning; Supply chain

Indexed keywords

BATCH-SCHEDULING; CAPACITATED LOT-SIZING; COMPUTATIONAL RESULTS; DOMINANCE PROPERTIES; HOLDING COSTS; LOT SIZING; LOT SIZING PROBLEMS; NP-HARD; PRODUCTION PLANNING; SCHEDULING PROBLEM; SET-UP TIME; SINGLE STAGE; SUB-PROBLEMS; TOTAL COSTS; TRANSPORTATION PLANS;

COMPUTATIONAL EFFICIENCY; PLANNING; PRODUCTION CONTROL; PRODUCTION ENGINEERING; PROJECT MANAGEMENT; SCHEDULING ALGORITHMS; SUPPLY CHAIN MANAGEMENT; SUPPLY CHAINS;

DYNAMIC PROGRAMMING;

EID: 77956242591     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. C. Jordan and A. Drexl, Discrete lotsizing and scheduling by batch sequencing, Management Science, vol.44, no.5, pp.698-713, 1998. (Pubitemid 128596874)
2. L. Zhao, L. Qu and M. Liu, Disruption coordination of closed-loop supply chain network (i) - Models and theorems, International Journal of Innovative Computing, Information and Control, vol.4, no.11, pp.2955-2964, 2008.
3. P. Brucker, Scheduling Algorithms, Springer Verlag, 2007.
4. C. N. Potts and M. Y. Kovalyov, Scheduling with batching: A review, European Journal of Opera-tional Research, vol.120, no.2, pp.228-249, 2000.
5. C. N. Potts and L. N. Van Wassenhove, Integrating scheduling with batching and lotsizing: A review of algorithms and complexity, Journal of the Operational Research Society, vol.43, pp.395-406, 1992.
6. B. Chen, C. N. Potts and V. A. Strusevich, Approximation algorithms for twomachine flow shop scheduling with batch setup times, Mathematical Programming, vol.82, no.1, pp.255-271, 1998.
7. C. L. Monma and C. N. Potts, On the complexity of scheduling with batch setup times, Operations Research, vol.37, pp.798-804, 1989.
8. J. B. Ghosh, Batch scheduling to minimize total completion time, Operations Research Letters, vol.16, no.5, pp.271-275, 1994.
9. G. Mosheiov and D. Oron, Single machine scheduling with batch-dependent setup times, Information Processing Letters, vol.98, no.2, pp.73-78, 2006.
10. P. Baptiste, Batching identical jobs, Mathematical Methods of Operations Research, vol.52, no.3, pp.355-367, 2000.
11. B. Karimi, S. M. T. Fatemi Ghomi and J. M. Wilson, The capacitated lot sizing problem: A review of models and algorithms, The International Journal of Management Science OMEGA, vol.31, no.5, pp.365-378, 2003.
12. B. Fleischmann, The discrete lot-sizing and scheduling problem with sequence dependent set-up costs, European Journal of Operational Research, vol.75, no.2, pp.395-404, 1994.
13. M. Salomon, M. M. Solomon, L. N. Van Wassenhove, Y. Dumas and S. Dauzère-Pérès, Solving the discrete lot-sizing and scheduling problem with sequence dependent setup costs and setup times using the traveling salesman problem with time windows, European Journal of Operational Research, vol.100, no.3, pp.494-513, 1997.
14. N. Brahimi, S. Dauzère-Pérès, N. M. Najid and A. Nordli, Single item lot sizing problems, European Journal of Operational Research, vol.168, no.1, pp.1-16, 2006.
15. A. Drexl and A. Kimms, Lot sizing and scheduling-survey and extensions, European Journal of Operational Research, vol.99, no.2, pp.221-235, 1997.
16. A. T. Staggemeier and A. R. Clark, A survey of lot-sizing and scheduling models, The 23rd Annual Symposium of the Brasilian Operational Research Society, Brasil, 2001.
17. L. A. Wolsey, Progress with single-item lot-sizing, European Journal of Operational Research, vol.86, no.3, pp.395-401, 1995.
18. I. Elmahi, O. Grunder and A. Elmoudni, A modelling-optimization approach for discrete event sys- tems using the (max,+) algebra and genetic algorithms, International Journal of Innovative Com- puting, Information and Control, vol.2, no.4, pp.771-788, 2006.
19. R. M. Karp, Complexity of computer computations, Reducibility Among Combinatorial Problems, pp.85-103, 1972.