Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

Alex J. Ruiz-Torres; Grisselle Centeno

doi:10.1016/j.cor.2006.07.013

Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

Computers & Operations Research ◽

10.1016/j.cor.2006.07.013 ◽

2008 ◽

Vol 35 (4) ◽

pp. 1227-1249 ◽

Cited By ~ 7

Author(s):

Alex J. Ruiz-Torres ◽

Grisselle Centeno

Keyword(s):

Permutation Flowshop ◽

Secondary Resources ◽

Number Of Late Jobs ◽

Late Jobs ◽

Flowshop Problem

Download Full-text

Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆

Omega ◽

10.1016/j.omega.2009.04.002 ◽

2010 ◽

Vol 38 (1-2) ◽

pp. 57-67 ◽

Cited By ~ 98

Author(s):

Eva Vallada ◽

Rubén Ruiz

Keyword(s):

Genetic Algorithms ◽

Path Relinking ◽

Permutation Flowshop ◽

Flowshop Problem

Download Full-text

A More Effective Constructive Algorithm for Permutation Flowshop Problem

Intelligent Data Engineering and Automated Learning – IDEAL 2006 - Lecture Notes in Computer Science ◽

10.1007/11875581_3 ◽

2006 ◽

pp. 25-32 ◽

Cited By ~ 3

Author(s):

Xingye Dong ◽

Houkuan Huang ◽

Ping Chen

Keyword(s):

Permutation Flowshop ◽

Constructive Algorithm ◽

Flowshop Problem

Download Full-text

Anarchy in the UJ: Coordination Mechanisms for Minimizing the Number of Late Jobs

European Journal of Operational Research ◽

10.1016/j.ejor.2021.11.047 ◽

2021 ◽

Author(s):

Dirk Briskorn ◽

Stefan Waldherr

Keyword(s):

Coordination Mechanisms ◽

Number Of Late Jobs ◽

Late Jobs

Download Full-text

Minimizing the Weighted Number of Late Jobs with Batch Setup Times and Delivery Costs on a Single Machine

Multiprocessor Scheduling, Theory and Applications ◽

10.5772/5216 ◽

2007 ◽

Cited By ~ 2

Author(s):

George Steiner ◽

Rui Zhang

Keyword(s):

Single Machine ◽

Setup Times ◽

Delivery Costs ◽

Weighted Number ◽

Number Of Late Jobs ◽

Late Jobs

Download Full-text

A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates

European Journal of Operational Research ◽

10.1016/j.ejor.2006.06.078 ◽

2008 ◽

Vol 189 (3) ◽

pp. 1284-1304 ◽

Cited By ~ 13

Author(s):

Ruslan Sadykov

Keyword(s):

Single Machine ◽

Release Dates ◽

Weighted Number ◽

Number Of Late Jobs ◽

Check Algorithm ◽

Late Jobs

Download Full-text

Deteriorating job scheduling to minimize the number of late jobs with setup times

Computers & Industrial Engineering ◽

10.1016/j.cie.2011.05.010 ◽

2011 ◽

Vol 61 (3) ◽

pp. 782-787 ◽

Cited By ~ 9

Author(s):

Wen-Chiung Lee ◽

Jian-Bang Lin ◽

Yau-Ren Shiau

Keyword(s):

Job Scheduling ◽

Setup Times ◽

Deteriorating Job ◽

Number Of Late Jobs ◽

Late Jobs

Download Full-text

Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

Management Science ◽

10.1287/mnsc.19.11.1283 ◽

1973 ◽

Vol 19 (11) ◽

pp. 1283-1288 ◽

Cited By ~ 30

Author(s):

Stephen J. Balut

Keyword(s):

Processing Times ◽

Number Of Late Jobs ◽

Set Up ◽

Late Jobs

Download Full-text

A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times

Simulation Modelling Practice and Theory ◽

10.1016/j.simpat.2017.09.001 ◽

2017 ◽

Vol 79 ◽

pp. 23-36 ◽

Cited By ~ 41

Author(s):

Eliana Maria Gonzalez-Neira ◽

Daniele Ferone ◽

Sara Hatami ◽

Angel A. Juan

Keyword(s):

Permutation Flowshop ◽

Processing Times ◽

Stochastic Processing ◽

Stochastic Processing Times ◽

Distributed Assembly ◽

Flowshop Problem

Download Full-text

A two-stage invasive weed optimization algorithm for distributed assembly permutation flowshop problem

2017 Chinese Automation Congress (CAC) ◽

10.1109/cac.2017.8244049 ◽

2017 ◽

Cited By ~ 1

Author(s):

Hong-yan Sang ◽

Quan-ke Pan ◽

Pei-yong Duan ◽

Jun-qing Li ◽

Peng Duan

Keyword(s):

Optimization Algorithm ◽

Invasive Weed Optimization ◽

Two Stage ◽

Permutation Flowshop ◽

Invasive Weed ◽

Distributed Assembly ◽

Flowshop Problem

Download Full-text

Open shop scheduling to minimize the number of late jobs

Naval Research Logistics (NRL) ◽

10.1002/(sici)1520-6750(199808)45:5<525::aid-nav6>3.0.co;2-5 ◽

1998 ◽

Vol 45 (5) ◽

pp. 525-532 ◽

Cited By ~ 3

Author(s):

Christos Koulamas ◽

George J. Kyparisis

Keyword(s):

Open Shop ◽

Open Shop Scheduling ◽

Shop Scheduling ◽

Number Of Late Jobs ◽

Late Jobs

Download Full-text