Related references
Note: Only part of the references are listed.Four decades of research on the open-shop scheduling problem to minimize the makespan
Mohammad Mahdi Ahmadian et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization
Levi R. Abreu et al.
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2021)
Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search
Xueqi Wu et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2020)
A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
E. G. Birgin et al.
COMPUTERS & OPERATIONS RESEARCH (2020)
A genetic algorithm for scheduling open shops with sequence-dependent setup times
Levi R. Abreu et al.
COMPUTERS & OPERATIONS RESEARCH (2020)
Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation
Fernando Luis Rossi et al.
SWARM AND EVOLUTIONARY COMPUTATION (2020)
Multiprocessor open shop problem: literature review and future directions
Zeynep Adak et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2020)
Review of job shop scheduling research and its new perspectives under Industry 4.0
Jian Zhang et al.
JOURNAL OF INTELLIGENT MANUFACTURING (2019)
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion
Damla Kizilay et al.
ALGORITHMS (2019)
Review and classification of hybrid shop scheduling
Kun Fan et al.
PRODUCTION ENGINEERING-RESEARCH AND DEVELOPMENT (2018)
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
Victor Fernandez-Viagas et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)
New approximate algorithms for the customer order scheduling problem with total completion time objective
Jose M. Framinan et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
Victor Fernandez-Viagas et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
A novel hybrid genetic algorithm for the open shop scheduling problem
Fardin Ahmadizar et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2012)
Modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time
Bahman Naderi et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2011)
A study on open shop scheduling to minimise total tardiness
B. Naderi et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2011)
Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
Danyu Bai et al.
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE (2011)
A contribution and new heuristics for open shop scheduling
B. Naderi et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
An improved NEH-based heuristic for the permutation flowshop problem
Xingye Dong et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
A new particle swarm optimization for the open shop scheduling problem
D. Y. Sha et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
Ruben Ruiz et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)
Heuristics for scheduling in a no-wait open shop with movable dedicated machines
Hung-Tso Lin et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2008)
Non-greedy heuristics and augmented neural networks for the open-shop scheduling problem
S Colak et al.
NAVAL RESEARCH LOGISTICS (2005)
Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling
C Blum
COMPUTERS & OPERATIONS RESEARCH (2005)
Competitive genetic algorithms for the open-shop scheduling problem
C Prins
MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2000)
Using intelligent backtracking to improve branch-and-bound methods:: An application to Open-Shop problems
C Guéret et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
A hybrid genetic algorithm for the open shop scheduling problem
CF Liaw
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
A label correcting approach for solving bicriterion shortest-path problems
AJV Skriver et al.
COMPUTERS & OPERATIONS RESEARCH (2000)
Share Paper
