A variable neighborhood search for job shop scheduling with set-up times to minimize makespan-Reference-Cited by-同舟云学术

A variable neighborhood search for job shop scheduling with set-up times to minimize makespan

Published:2009-06 Issue:6 Volume:25 Page:654-661
ISSN:0167-739X
Container-title:Future Generation Computer Systems
language:en
Short-container-title:Future Generation Computer Systems

Author:

Roshanaei V.,Naderi B.,Jolai F.,Khalili M.

Publisher

Elsevier BV

Subject

Computer Networks and Communications,Hardware and Architecture,Software

Reference35 articles.

1. Industrial Scheduling;Sule,1997

2. Scheduling job shop problems with sequence-dependent set-up times;Naderi;International journal of production research,2008

3. A new approach to solve hybrid flow shop scheduling problems by artificial immune system;Engi;Future Generation Computer Systems,2004

4. Scheduling hybrid flowshops with sequence-dependent set-up times to minimize makespan and maximum tardiness;Naderi;International Journal of Advanced Manufacturing Technology,2008

5. An iterated greedy heuristic for the sequence-dependent set-up times flowshop problem with makespan and weighted tardiness objectives;Ruiz;European Journal of Operational Research,2008

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

1. Exploring the evolution of machine scheduling through a computational approach;Engineering Applications of Artificial Intelligence;2024-07

2. Synchronised warehousing and transportation operations of export containers considering supply chain disruptions;Ocean & Coastal Management;2024-05

3. Interpretability, Adaptability and Scalability of Variable Neighborhood Search;Lecture Notes in Computer Science;2024

4. Scheduling and Controlling Production in an Internet of Things Environment for Industry 4.0: An Analysis and Systematic Review of Scientific Metrological Data;Sustainability;2023-05-05

5. Scheduling;Computational Intelligence in Logistik und Supply Chain Management;2023