A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing

2021 ◽

Author(s):

Mohammad Mahdi Ahmadian ◽

Mostafa Khatami ◽

Amir Salehipour ◽

T.C.E. Cheng

Keyword(s):

Open Shop ◽

Scheduling Problem ◽

Open Shop Scheduling ◽

Shop Scheduling

Download Full-text

A fuzzy multi-objective tabu-search method for a new bi-objective open shop scheduling problem

2009 International Conference on Computers & Industrial Engineering ◽

10.1109/iccie.2009.5223549 ◽

2009 ◽

Cited By ~ 4

Author(s):

O. Seraj ◽

R. Tavakkoli-Moghaddam ◽

F. Jolai

Keyword(s):

Tabu Search ◽

Search Method ◽

Open Shop ◽

Scheduling Problem ◽

Open Shop Scheduling ◽

Shop Scheduling ◽

Multi Objective ◽

Tabu Search Method

Download Full-text

Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage

Applied Mathematics-A Journal of Chinese Universities ◽

10.1007/s11766-013-3146-2 ◽

2013 ◽

Vol 28 (3) ◽

pp. 358-368 ◽

Cited By ~ 2

Author(s):

Jian-ming Dong ◽

Jue-liang Hu ◽

Yong Chen

Keyword(s):

Flow Shop ◽

Open Shop ◽

Flow Shop Scheduling ◽

Hybrid Flow Shop ◽

Scheduling Problem ◽

Two Stage ◽

Shop Scheduling ◽

One Stage ◽

Hybrid Flow Shop Scheduling

Download Full-text

Single Objective for an Integer Partial Flexible Open Shop Scheduling Problem Using Developed Ant Colony Optimization

International Journal of Mechanical and Production Engineering Research and Development ◽

10.24247/ijmperdjun2018117 ◽

2018 ◽

Vol 8 (3) ◽

pp. 1121-1132

Author(s):

G. Umashankar et al., G. Umashankar et al., ◽

Keyword(s):

Ant Colony Optimization ◽

Open Shop ◽

Ant Colony ◽

Scheduling Problem ◽

Open Shop Scheduling ◽

Shop Scheduling ◽

Single Objective

Download Full-text

Heuristic Rules and Genetic Algorithms for Open Shop Scheduling Problem

Current Topics in Artificial Intelligence - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25945-9_39 ◽

2004 ◽

pp. 394-403 ◽

Cited By ~ 3

Author(s):

Jorge Puente ◽

Helio R. Díez ◽

Ramiro Varela ◽

Camino R. Vela ◽

Luis P. Hidalgo

Keyword(s):

Genetic Algorithms ◽

Open Shop ◽

Scheduling Problem ◽

Heuristic Rules ◽

Open Shop Scheduling ◽

Shop Scheduling

Download Full-text

A Mixed-Integer Linear Model for Solving the Open Shop Scheduling Problem

Service Oriented, Holonic and Multi-Agent Manufacturing Systems for Industry of the Future - Studies in Computational Intelligence ◽

10.1007/978-3-030-80906-5_21 ◽

2021 ◽

pp. 301-310

Author(s):

Daniel Morillo-Torres ◽

Gustavo Gatica

Keyword(s):

Linear Model ◽

Open Shop ◽

Mixed Integer ◽

Scheduling Problem ◽

Open Shop Scheduling ◽

Shop Scheduling ◽

Integer Linear Model

Download Full-text

Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-030-92681-6_40 ◽

2021 ◽

pp. 512-526

Author(s):

Yuan Yuan ◽

Xin Han ◽

Xinbo Liu ◽

Yan Lan

Keyword(s):

Open Shop ◽

Scheduling Problem ◽

Maintenance Period ◽

Open Shop Scheduling ◽

Shop Scheduling

Download Full-text

An improved bat optimization algorithm to solve the tasks scheduling problem in open shop

Neural Computing and Applications ◽

10.1007/s00521-020-05055-7 ◽

2020 ◽

Author(s):

Morteza Babazadeh Shareh ◽

Shirin Hatami Bargh ◽

Ali Asghar Rahmani Hosseinabadi ◽

Adam Slowik

Keyword(s):

Optimization Algorithm ◽

Open Shop ◽

Scheduling Problem ◽

Tasks Scheduling

Download Full-text

An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem

The International Journal of Advanced Manufacturing Technology ◽

10.1007/s00170-011-3546-5 ◽

2011 ◽

Vol 59 (9-12) ◽

pp. 1143-1155 ◽

Cited By ~ 6

Author(s):

Seyed Hossein Hashemi Doulabi ◽

Milad Avazbeigi ◽

Sahar Arab ◽

Hamid Davoudpour

Keyword(s):

Simulated Annealing ◽

Open Shop ◽

Mixed Integer ◽

Just In Time ◽

Scheduling Problem ◽

Open Shop Scheduling ◽

Shop Scheduling ◽

Hybrid Simulated Annealing

Download Full-text

Group technology approach to the open shop scheduling problem with batch setup times

Operations Research Letters ◽

10.1016/s0167-6377(00)00021-3 ◽

2000 ◽

Vol 26 (4) ◽

pp. 181-192 ◽

Cited By ~ 16

Author(s):

V.A. Strusevich

Keyword(s):

Group Technology ◽

Open Shop ◽

Setup Times ◽

Scheduling Problem ◽

Open Shop Scheduling ◽

Shop Scheduling

Download Full-text

A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing

Four decades of research on the open-shop scheduling problem to minimize the makespan

A fuzzy multi-objective tabu-search method for a new bi-objective open shop scheduling problem

Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage

Single Objective for an Integer Partial Flexible Open Shop Scheduling Problem Using Developed Ant Colony Optimization

Heuristic Rules and Genetic Algorithms for Open Shop Scheduling Problem

A Mixed-Integer Linear Model for Solving the Open Shop Scheduling Problem

Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period

An improved bat optimization algorithm to solve the tasks scheduling problem in open shop

An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem

Group technology approach to the open shop scheduling problem with batch setup times

Export Citation Format