Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs-Reference-Cited by-同舟云学术

Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs

Published:1996-04 Issue:2 Volume:90 Page:200-213
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Crauwels H.A.J.,Potts C.N.,Van Wassenhove L.N.

Publisher

Elsevier BV

Subject

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

Reference10 articles.

1. Complexity of task sequencing with deadlines, set-up times and changeover costs;Bruno;SIAM Journal on Computing,1978

2. Simulated annealing: a tool for operational research;Eglese;European Journal of Operational Research,1990

3. Tabu search, Part I;Glover;ORSA Journal on Computing,1989

4. Genetic Algorithms in Search, Optimization and Machine Learning;Goldberg,1989

5. Optimization by simulated annealing;Kirkpatrick;Science,1983

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

1. A Novel Approach for Optimum Planning of Bobbin Boilers in Textile Industry;TEKSTİL VE KONFEKSİYON;2021-10-11

2. Decomposition Method for New Single-Machine Scheduling Problems From Steel Production Systems;IEEE Transactions on Automation Science and Engineering;2019

3. A hybrid heuristic approach to minimize number of tardy jobs in group technology systems;International Transactions in Operational Research;2017-05-15

4. An enhanced ABC algorithm for single machine order acceptance and scheduling with class setups;Applied Soft Computing;2016-07

5. A survey of single machine scheduling to minimize weighted number of tardy jobs;Journal of Industrial & Management Optimization;2014