Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time

We consider two-machine flow shop problems with exact delays. In this model, there are two machines, the upstream machine and the downstream machine. Each job j has two operations: the first operation has to be processed on the upstream machine and the second operation has to be processed on the downstream machine, subject to the constraint that the time interval between the completion time of the first operation and the start time of the second operation is exactly [Formula: see text]. We concentrate on the objectives of makespan and total completion time. For the makespan objective, we first show that the problem is strongly NP-hard even if there are only two possible delay values. We then show that some special cases of the problem are solvable in polynomial time. Finally, we design efficient approximation algorithms for the general case and some special cases. For the total completion time objective, we give optimal polynomial-time algorithm for a special case and an efficient approximation algorithm for another one.

Download Full-text

A Simulation Study Of Economic Production Quantity Lot Size To Kanban For A Single Line Production System Under Various Setup Times With Completion Time As Performance Metric

Journal of Business & Economics Research (JBER) ◽

10.19030/jber.v7i10.2339 ◽

2011 ◽

Vol 7 (10) ◽

Author(s):

Terrence J. Moran ◽

Marvin Troutt

Keyword(s):

Completion Time ◽

Setup Time ◽

Performance Measure ◽

Total Completion Time ◽

Lot Size ◽

Line Production ◽

Economic Production Quantity ◽

Performance Metric ◽

Economic Production ◽

Production Quantity

<h1 style="page-break-after: auto; text-align: justify; line-height: normal; margin: 0in 0.5in 0pt; mso-pagination: none;">The Setup time variable was evaluated for the two systems (Kanban and EPQ) against the performance measure of total completion time.  EPQ outperforms Kanban on total completion time.  The research helped clarify for practitioners whether EPQ might be more suitable than Kanban for their given situations.  </h1>

Download Full-text

An improved algorithm to minimize the total completion time in a two-machine no-wait flow-shop with uncertain setup times

Journal of Project Management ◽

10.5267/j.jpm.2021.9.001 ◽

2022 ◽

Vol 7 (1) ◽

pp. 1-12 ◽

Cited By ~ 1

Author(s):

Muberra Allahverdi

Keyword(s):

Completion Time ◽

Flow Shop ◽

Performance Measure ◽

Setup Times ◽

Total Completion Time ◽

Average Percentage ◽

Percentage Improvement ◽

Wide Range ◽

Test Of Hypothesis ◽

No Wait

Since scheduling literature has a wide range of uncertainties, it is crucial to take these into account when solving performance measure problems. Otherwise, the performance may severely be affected in a negative way. In this paper, an algorithm is proposed to minimize the total completion time (TCT) of a two-machine no-wait flowshop with uncertain setup times within lower and upper bounds. The results are compared to the best existing algorithm in scheduling literature: the programming language Python is used to generate random samples with respect to various distributions, and the TCT of the proposed algorithm is compared to that of the best existing one. Results reveal that the proposed one significantly outperforms the best one given in literature for all considered distributions. Specifically, the average percentage improvement of the proposed algorithm over the best existing one is over 90%. A test of hypothesis is conducted to further confirm the results.

Download Full-text