Batch scheduling with step‐deteriorating processing times to minimize flowtime

Mor, Baruch; Mosheiov, Gur

doi:10.1002/nav.21508

Cited by 14 publications

(9 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, the research on batch scheduling problems with machine deterioration effect has been widely studied, such as Barketau et al [8], Ji and Cheng [9], and Mor and Mosheiov [10]. Barketau et al.…”

Section: Introductionmentioning

confidence: 99%

An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

Yusriski

Sukoyo

Samadhi

et al. 2016

IOP Conf. Ser.: Mater. Sci. Eng.

View full text Add to dashboard Cite

In the manufacturing industry, several identical parts can be processed in batches, and setup time is needed between two consecutive batches. Since the processing times of batches are not always fixed during a scheduling period due to learning and deterioration effects, this research deals with batch scheduling problems with simultaneous learning and deterioration effects. The objective is to minimize total actual flow time, defined as a time interval between the arrival of all parts at the shop and their common due date. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. This research proposes a heuristic algorithm based on the Lagrange Relaxation. The effectiveness of the proposed algorithm is determined by comparing the resulting solutions of the algorithm to the respective optimal solution obtained from the enumeration method. Numerical experience results show that the average of difference among the solutions is 0.05%.

show abstract

Section: Introductionmentioning

confidence: 99%

An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

Yusriski

Sukoyo

Samadhi

et al. 2016

IOP Conf. Ser.: Mater. Sci. Eng.

View full text Add to dashboard Cite

show abstract

“…Furthermore, Layegh et al [22] studied the total weighted completion time scheduling problem on a single machine under job step deterioration assumption, and proposed a memetic algorithm with the average percentage error of 2%. Alternatively, batch scheduling with step-deteriorating effect also attracts the attention of some researchers, for example, referring to Barketau et al [3], Leung et al [24] and Mor and Mosheiov [25]. With regard to the piecewise linear deteriorating model, the single machine scheduling problem with makespan minimization was firstly addressed in [20].…”

Section: Introductionmentioning

confidence: 99%

Scheduling step-deteriorating jobs to minimise the total weighted tardiness on a single machine

Guo

Wang

2015

International Journal of Systems Science: Operations & Logi

View full text Add to dashboard Cite

This paper addresses the scheduling problem of minimizing the total weighted tardiness on a single machine with step-deteriorating jobs. With the assumption of deterioration, the job processing times are modeled by step functions of job starting times and pre-specified job deteriorating dates. The introduction of step-deteriorating jobs makes a single machine total weighted tardiness problem more intractable. The computational complexity of this problem under consideration was not determined. In this study, it is firstly proved to be strongly NP-hard. Then a mixed integer programming model is derived for solving the problem instances optimally. In order to tackle large-sized problems, seven dispatching heuristic procedures are developed for near-optimal solutions. Meanwhile, the solutions delivered by the proposed heuristic are further improved by a pair-wise swap movement. Computational results are presented to reveal the performance of all proposed approaches.

show abstract

“…The objectives are to minimize the expected makespan and the variance of the makespan. Mor and Mosheiov (2012) consider a classical batch scheduling model with step-deterioration of processing times. The objective is to minimize flowtime.…”

Section: Introductionmentioning

confidence: 99%

Minimizing total completion time on a single machine with step improving jobs

Kim

Oron

2015

Journal of the Operational Research Society

View full text Add to dashboard Cite

Production systems often experience a shock or a technological change, resulting in performance improvement. In such settings, job processing times become shorter if jobs start processing at, or after, a common critical date. This paper considers a single machine scheduling problem with step-improving processing times, where the effects are job-dependent. The objective is to minimize the total completion time. We show that the problem is NP-hard in general and discuss several special cases which can be solved in polynomial time. We formulate a Mixed Integer Programming model and develop an LP-based heuristic for the general problem. Finally, computational experiments show that the proposed heuristic yields very effective and efficient solutions.

show abstract

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Cited by 14 publications

References 18 publications

An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

Scheduling step-deteriorating jobs to minimise the total weighted tardiness on a single machine

Minimizing total completion time on a single machine with step improving jobs

Contact Info

Product

Resources

About