Results 221 to 230 of about 25,491 (243)
Some of the next articles are maybe not open access.
New results for minimising variation of flow time in two-machine proportionate no-wait flow shops
International Journal of Production Research, 2020In this paper, the two-machine no-wait proportionate flow shop problem is analysed with the objective of minimising the total absolute deviation of job completion times.
S. S. Panwalkar, Christos Koulamas
openaire +1 more source
Journal of Scheduling, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baruch Mor, Gur Mosheiov, Dvir Shabtay
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baruch Mor, Gur Mosheiov, Dvir Shabtay
openaire +2 more sources
On the dominance of permutation schedules for some ordered and proportionate flow shop problems
Computers & Industrial Engineering, 2017We consider the ordered and the proportionate flow shop with unequal machine speeds.We consider both the Cmax and the j=1nCj objectives.We show that permutation schedules are dominant for Cmax with V-shaped speeds.We show that permutation schedules are dominant for j=1nCj with three stages.
S. S. Panwalkar, Christos Koulamas
openaire +1 more source
The three-machine proportionate flow shop problem with unequal machine speeds
Operations Research Letters, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hou, Sixiang, Hoogeveen, Han
openaire +2 more sources
International Journal of Production Research, 2006
In this paper, we consider the problem of minimizing the total weighted completion time in an n-job, two-machine proportionate flow shop, where job processing times are inversely proportional to machine speeds. We show that the problem is NP-complete. We provide a tight lower bound to an optimal objective value and show that the worst-case performance ...
Byung-Cheon Choi, Sung-Jin Chung
exaly +2 more sources
In this paper, we consider the problem of minimizing the total weighted completion time in an n-job, two-machine proportionate flow shop, where job processing times are inversely proportional to machine speeds. We show that the problem is NP-complete. We provide a tight lower bound to an optimal objective value and show that the worst-case performance ...
Byung-Cheon Choi, Sung-Jin Chung
exaly +2 more sources
International Journal of Advanced Manufacturing Technology, 2007
In a proportionate flow shop problem, jobs have to be processed through a fixed sequence of machines, and processing time for each job is equal on all machines. Such a problem has seldom been tackled. Proportionate flexible flow shop (PFFS) scheduling problems combine the properties of proportionate flow shop scheduling problems and parallel machine ...
Yueh-Min Huang
exaly +2 more sources
In a proportionate flow shop problem, jobs have to be processed through a fixed sequence of machines, and processing time for each job is equal on all machines. Such a problem has seldom been tackled. Proportionate flexible flow shop (PFFS) scheduling problems combine the properties of proportionate flow shop scheduling problems and parallel machine ...
Yueh-Min Huang
exaly +2 more sources
Proportionate Flow Shop Scheduling with Multi-agents to Maximize Total Gains of JIT Jobs
Arabian Journal for Science and Engineering, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Shi-Sheng +2 more
openaire +2 more sources
Asia-Pacific Journal of Operational Research, 2020
We investigate a competitive two-agent scheduling problem in the setting of proportionate flow shop, where the job processing times are machine-independent. The scheduling criterion of one agent is to minimize its total weighted late work, and the scheduling criterion of the other agent is to minimize its total weighted number of late jobs.
Ren-Xia Chen, Shi-Sheng Li
openaire +1 more source
We investigate a competitive two-agent scheduling problem in the setting of proportionate flow shop, where the job processing times are machine-independent. The scheduling criterion of one agent is to minimize its total weighted late work, and the scheduling criterion of the other agent is to minimize its total weighted number of late jobs.
Ren-Xia Chen, Shi-Sheng Li
openaire +1 more source
Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion
International Journal of Production Research, 2018The problem of minimising total absolute deviation of job completion times in a two-machine no-wait proportionate flow shop has been recently studied.
Sergey Kovalev +3 more
openaire +1 more source
Proportionate Flow Shop Scheduling with Job-dependent Due Windows and Position-dependent Weights
Asia-Pacific Journal of Operational ResearchIn this paper, we deal with the different due windows assignment proportionate flow shop problem with position-dependent weights, where the sequence is a permutation. The objective is to determine an optimal job sequence and due windows of all jobs such that the weighted sum of earliness–tardiness, the starting time and size of all due windows is to ...
Ji-Bo Wang, Dan-Yang Lv, Congying Wan
openaire +1 more source