V-Shaped Policies for Scheduling Deteriorating Jobs

Mosheiov, Gur

doi:10.1287/opre.39.6.979

Cited by 176 publications

(62 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…First studies about deterioration effect in scheduling problems were considered by Gupta and Gupta (1988) and Browne and Yechiali (1990). Some of other studies about scheduling problems under deterioration effect were investigated by Mosheiov (1991Mosheiov ( , 1995Mosheiov ( , 1998Mosheiov ( , 2002, Ng, Cheng, Bachman and Janiak (2002), Bachman, Janiak and Kovalyov (2002), Wang and Xia (2006), Wu and Lee (2008), Wang, Daniel, Cheng and Liu (2006), and Gawiejnowicz (2007).…”

Section: Literature Reviewmentioning

confidence: 99%

Genetic algorithm applied to the flow shop scheduling problem under effects of fuzzy learning and deterioration with a common fuzzy due date

Toksarı

2017

PROSOC

View full text Add to dashboard Cite

This research is to develop an approximate solution for a flow shop scheduling problem under the effects of fuzzy learning and deterioration with a common fuzzy due date by applying genetic algorithm technique. Real life is complex and filled with ambiguity and uncertainty. Due dates may not be always determined by a decision maker because of their biased approach and past experiences. Therefore, due dates may be defined in forms of any fuzzy set to encode decision maker's biased approaches and satisfaction levels for completion times of jobs. The objective function of the problem in this research is to maximise decision maker's sum of satisfaction levels with respect to completion times of jobs on a flow shop scheduling environment by applying genetic algorithm technique.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Genetic algorithm applied to the flow shop scheduling problem under effects of fuzzy learning and deterioration with a common fuzzy due date

Toksarı

2017

PROSOC

View full text Add to dashboard Cite

show abstract

“…Deteriorating jobs are tasks which need more time and more efforts to complete the process than when they are done earlier. and Mosheiov [2] were first introduced deteriorating jobs in the scheduling area. After a while, deteriorating jobs were getting more attention.…”

Section: Introductionmentioning

confidence: 99%

An efficient time algorithm for makespan objectives

Öztürkoğlu

2015

Int. J. Optim. Control, Theor. Appl. (IJOCTA)

View full text Add to dashboard Cite

Abstract. This paper focuses on a single machine scheduling subject to machine deterioration with rate-modifying activities (RMA). The motivation for this study stems from the automatic-production line problem with one machine. The main question is to find the sequence in which jobs should be scheduled, how many maintenance activity (RMA) to use, if any, and where to insert them in the schedule during the time interval with optimal makespan objective. This problem is known to be NPhard and we give concise analyses of the problem and provide polynomial time algorithms to solve the makespan problem. We also propose an algorithm which can be applied to some scheduling problems with the actual processing time of job nonlinearly based on its position.

show abstract

“…The latter varies over time and is the product of the job start time and a jobdependent deterioration index. The makespan minimization problem on a single machine is shown to be solved in polynomial time using a simple sorting rule; however, the total completion time counterpart remains open even when the basic processing times are assumed to be identical for all jobs (see Mosheiov, 1991). The second category of time-dependent processing time scheduling models addresses piece-wise linear job processing time functions.…”

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

V-Shaped Policies for Scheduling Deteriorating Jobs

Cited by 176 publications

References 0 publications

Genetic algorithm applied to the flow shop scheduling problem under effects of fuzzy learning and deterioration with a common fuzzy due date

Genetic algorithm applied to the flow shop scheduling problem under effects of fuzzy learning and deterioration with a common fuzzy due date

An efficient time algorithm for makespan objectives

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

Contact Info

Product

Resources

About