Results 211 to 220 of about 25,491 (243)
Some of the next articles are maybe not open access.
A note on makespan minimization in proportionate flow shops
Information Processing Letters, 2010We consider two generalizations of the proportionate o w shop scheduling problem with the makespan objective. Each job has a processing requirement and each machine has a characteristic value. In our rst (second) case we assume that the time a job occupies a machine is the maximum (minimum) of the processing requirement of the job and the ...
Byung-Cheon Choi +2 more
openaire +1 more source
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
Expert Systems With Applications, 2008The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A proportionate flexible flow shop (PFFS) is a machine environment with parallel identical machines at each stage.
Yueh-Min Huang
exaly +2 more sources
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
European Journal of Operational Research, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Byung-Cheon Choi, Sung-Jin Chung
exaly +3 more sources
Minimizing total weighted completion time in a proportionate flow shop
Journal of Scheduling, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Natalia V Shakhlevich +2 more
exaly +4 more sources
Flow shops with machine maintenance: Ordered and proportionate cases
European Journal of Operational Research, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Byung-Cheon Choi +3 more
openaire +3 more sources
Proportionate flow shop with controllable processing times
Journal of Scheduling, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, T. C. Edwin, Shakhlevich, Natalia
openaire +2 more sources
Proportionate flow shop: New complexity results and models with due date assignment
Naval Research Logistics, 2015AbstractIt is known that the proportionate flow shop minimum makespan problem is solved optimally by any permutation job sequence. We show that the problem is at least ordinary NP‐hard when missing operations are allowed and present some solvable cases.
Christos Koulamas
exaly +2 more sources
Two-stage proportionate flexible flow shop to minimize the makespan
Journal of Combinatorial Optimization, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Byung-Cheon Choi, Kangbok Lee
openaire +3 more sources
Journal of Scheduling, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dvir Shabtay, Baruch Mor
exaly +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dvir Shabtay, Baruch Mor
exaly +2 more sources
Review of the ordered and proportionate flow shop scheduling research
Naval Research Logistics (NRL), 2013AbstractOrdered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc.
Panwalkar, S. S. +2 more
openaire +1 more source