Heuristic procedures for minimizing makespan and the number of required pallets-Reference-Cited by-同舟云学术

Heuristic procedures for minimizing makespan and the number of required pallets

Published:1995-11 Issue:3 Volume:86 Page:491-502
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Chu Chengbin,Proth Jean-Marie,Sethi Suresh

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference18 articles.

1. A heuristic algorithm for the n-job, m-machine sequencing problem;Campbell;Management Science,1970

2. Sequencing and Scheduling. An Introduction to the Mathematics of the Job-Shop;French,1982

3. Four simple heuristics for scheduling a flowshop;Gelders;International Journal of Production Research,1978

4. On two-machine scheduling with release and due dates to minimize maximum lateness;Grabowski;Operations Research,1980

5. A new algorithm of solving the flow-shop problem;Grabowski,1982

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scheduling in Industrial environment toward future: insights from Jean-Marie Proth;International Journal of Production Research;2023-08-10

2. Minimizing the weighted number of tardy jobs on multiple machines: A review;Journal of Industrial and Management Optimization;2016-01

3. Sustainable and Robust Control of Cyclic Pallet Systems;IEEE Transactions on Automation Science and Engineering;2013-10

4. Energy Reduction in a Pallet-Constrained Flow Shop Through On–Off Control of Idle Machines;IEEE Transactions on Automation Science and Engineering;2013-01

5. A heuristic to minimize makespan of cell scheduling problem;International Journal of Production Economics;2004-04