The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform
Gur Mosheiov - One of the best experts on this subject based on the ideXlab platform.
-
scheduling a deteriorating Maintenance Activity and due window assignment
Computers & Operations Research, 2015Co-Authors: Baruch Mor, Gur MosheiovAbstract:Several papers published during the last decade dealt with scheduling a Maintenance Activity and considered a new setting, where the Maintenance duration is assumed to be deteriorating, i.e., it requires more time or effort if it is delayed. We study a deteriorating Maintenance in the context of due-window assignment, where a time interval is determined such that jobs completed within this interval are "on-time", whereas early and tardy jobs are penalized. Thus, our paper extends known models by considering simultaneously a deteriorating Maintenance and due-window. Two deterioration types are considered: time-dependent (where the Maintenance time increases as a function of its starting time), and position-dependent (where it is a function of its position in the sequence). The classical assumption of position-independent processing times was considered first, and then the model is extended to general position-dependent processing times. We prove several properties of the optimal timing of the due-window and of the Maintenance. Consequently, we show that all the problems studied here are solved in O ( n 4 ) , where n is the number of jobs.
-
scheduling a Maintenance Activity and due window assignment based on common flow allowance
International Journal of Production Economics, 2012Co-Authors: Baruch Mor, Gur MosheiovAbstract:Abstract We study a due-window assignment problem on a single machine. The job-dependent due-windows are obtained by the common flow allowance criterion. The scheduler has the option to perform a Maintenance Activity which is rate modifying, i.e., improves the processing times of the following jobs. We consider a number of versions of this setting: (i) The Maintenance requires a constant time, (ii) The Maintenance duration is an increasing function of its starting time (linear deterioration), and (iii) The Maintenance duration is position-dependent (general deterioration). We study the standard setting of regular job processing times, and investigate also the extension to position-dependent processing times. The set of potential optimal positions for the Maintenance Activity is fully characterized. Consequently, the problems based on all the combinations of these settings are shown to be solved in polynomial time.
-
scheduling a deteriorating Maintenance Activity on a single machine
Journal of the Operational Research Society, 2010Co-Authors: Gur Mosheiov, Jeffrey B SidneyAbstract:We study a problem of scheduling a Maintenance Activity on a single machine. Following several recent papers, the Maintenance is assumed to be deteriorating, that is, delaying the Maintenance increases the time required to perform it. The following objective functions are considered: makespan, flowtime, maximum lateness, total earliness, tardiness and due-date cost, and number of tardy jobs. We introduce polynomial time solutions for all these problems.
-
scheduling a Maintenance Activity and due window assignment on a single machine
Computers & Operations Research, 2009Co-Authors: Gur Mosheiov, Assaf SarigAbstract:We study a single machine scheduling and due-window assignment problem. In addition to the traditional decisions regarding sequencing the jobs and scheduling the due-window, we allow an option for performing a Maintenance Activity. This Activity requires a fixed time interval during which the machine is turned off and no production is performed. On the other hand, after the Maintenance time, the machine becomes more efficient, as reflected in the new shortened job processing times. The objective is to schedule the jobs, the due-window and the Maintenance Activity, so as to minimize the total cost consisting of earliness, tardiness, and due-window starting time and size. We introduce an efficient (polynomial time) solution for this problem.
-
due date assignment and Maintenance Activity scheduling problem
Mathematical and Computer Modelling, 2006Co-Authors: Gur Mosheiov, Daniel OronAbstract:In the scheduling problem addressed in this note we have to determine: (i) the job sequence, (ii) the (common) due-date, and (iii) the location of a rate modifying (Maintenance) Activity. Jobs scheduled before (after) the due-date are penalized according to their earliness (tardiness) value. The processing time of a job scheduled after the Maintenance Activity decreases by a job-dependent factor. The objective is minimum total earliness, tardiness and due-date cost. We introduce a polynomial (O(n^4)) solution for the problem.
Darli Yang - One of the best experts on this subject based on the ideXlab platform.
-
common due window assignment and scheduling of linear time dependent deteriorating jobs and a deteriorating Maintenance Activity
International Journal of Production Economics, 2012Co-Authors: T C E Cheng, Suhjenq Yang, Darli YangAbstract:Due-window assignment and production scheduling are important issues in operations management. In this study we investigate the problem of common due-window assignment and scheduling of deteriorating jobs and a Maintenance Activity simultaneously on a single-machine. We assume that the Maintenance duration depends on its starting time. We provide polynomial time solutions for the problem and some of its special cases, where the objective is to simultaneously minimize the earliness, tardiness, due-window starting time, and due-window size costs.
-
minimizing the total completion time in single machine scheduling with aging deteriorating effects and deteriorating Maintenance activities
Computers & Mathematics With Applications, 2010Co-Authors: Suhjenq Yang, Darli YangAbstract:In a real manufacturing system, a machine may need multiple Maintenance activities to improve its production efficiency due to the effects of aging or deteriorating. This paper considers scheduling with aging or deteriorating effects and deteriorating Maintenance activities simultaneously on a single machine. We assume that the machine may be subject to several Maintenance activities during the planning horizon. However, due to the restriction of budget of Maintenance, the upper bound of the Maintenance frequency on the machine is assumed to be known in advance. Moreover, we assume that the duration of each Maintenance Activity depends on the running time of the machine. The objective is to find jointly the optimal Maintenance frequencies, the optimal Maintenance positions, and the optimal job sequence for minimizing the total completion time. We show that all the problems studied are polynomially solvable.
-
single machine scheduling with due date assignment and aging effect under a deterioratingMaintenance Activity consideration
International journal of information and management sciences, 2010Co-Authors: Suhjenq Yang, Darli Yang, Choujung HsuAbstract:This study investigates single-machine due-date assignment and scheduling problems with a job-dependent aging effect under a deteriorating Maintenance Activity consideration simul-taneously. The Maintenance Activity can be scheduled immediately after any one of the jobs has been completed. In order to model the problem more realistic, we assume that: (1) once the Maintenance Activity has been completed, the machine will revert to its initial condition and the aging effect will start anew, and (2) the machine Maintenance duration depends on its starting time. The objective is to find the optimal Maintenance position as well as the optimal location of the common due-date for minimizing the total of earliness, tardiness and due-date costs. We introduce a polynomial O(n^4) time solution for the problem. We also present two special cases of the problem and show that they can be optimally solved by a lower order algorithm.
Riad Aggoune - One of the best experts on this subject based on the ideXlab platform.
-
minimizing the makespan for the flow shop scheduling problem with availability constraints
European Journal of Operational Research, 2004Co-Authors: Riad AggouneAbstract:This paper deals with the scheduling of a flow shop with availability constraints (FSPAC). In such a problem, machines are not continuously available for processing jobs due to a preventive Maintenance Activity. A small number of solution methods exists in the literature for solving problems with at most two machines and to the author's knowledge only a few of them make use of the non-preemptive constraint. In this paper, two variants of the non-preemptive FSPAC with an arbitrary number of machines and an arbitrary number of unavailability periods on each of them are considered. In the first variant, starting times of Maintenance tasks are fixed while in the second one the Maintenance tasks must be performed on given time windows. Since the FSPAC is NP-hard in the strong sense, a heuristic approach based on a genetic algorithm and a tabu search is proposed to approximately solve the makespan minimization problem. Computational experiments are performed on randomly generated instances to show the efficiency of the proposed approaches.
-
flow shop scheduling problem with limited machine availability a heuristic approach
International Conference on Industrial Engineering and Production Management - IEPM'2003, 2003Co-Authors: Riad Aggoune, Marieclaude PortmannAbstract:This paper addresses the flow shop scheduling problem with limited machine availability. In such a problem, N jobs have to be scheduled on m machines with minimum cost under the assumption that the machines are not available during the whole planning horizon, due in particular to a preventive Maintenance Activity. Since the makespan minimization is strongly NP-hard, we propose a heuristic approach to approximately solve the problem. This approach consists in scheduling the jobs two per two according to an input sequence and using a polynomial algorithm locally optimal. This algorithm is an extension of the geometric approach developed for the two-job shop-scheduling problem. As the performance of the heuristic depends on the input sequence, we use a tabu search to optimize it. Experiments are performed on randomly generated instances to test the efficiency of the proposed approach. || On s'interesse au probleme d'ordonnancement de type "flow shop" lorsque les machines ne sont pas toujours disponibles. N travaux doivent etre ordonnances sur M machines qui ont des periodes d'indisponibilite au cours du temps, dues en particulier a de la
-
minimizing the makespan for the flow shop scheduling problem with availability constraints
Operational Research Peripatetic Post-Graduate Programme - ORP3, 2001Co-Authors: Riad AggouneAbstract:This paper deals with the scheduling of a flow shop with availability constraints (FSPAC). In such a problem, machines are not continuously available for processing jobs due to a preventive Maintenance Activity. A small number of solution methods exists in the literature for solving problems with at most two machines and to the author's knowledge only a few of them make use of the non-preemptive constraint. In this paper, two variants of the non-preemptive FSPAC with an arbitrary number of machines and an arbitrary number of unavailability periods on each of them are considered. In the first variant, starting times of Maintenance tasks are fixed while in the second one the Maintenance tasks must be performed on given time windows. Since the FSPAC is NP-hard in the strong sense, a genetic algorithm and a tabu search approach are proposed to approximately solve the makespan minimization problem. Computational experiments are performed on randomly generated instances to show the efficiency of the proposed approaches.
T C E Cheng - One of the best experts on this subject based on the ideXlab platform.
-
single machine scheduling with a variable Maintenance Activity
Computers & Industrial Engineering, 2015Co-Authors: Wenchang Luo, T C E ChengAbstract:We consider the problem of scheduling a Maintenance Activity and jobs on a single machine, where the Maintenance Activity must start before a given deadline and the Maintenance duration increases with its starting time. We provide polynomial-time algorithms to solve the problems to minimize the makespan, sum of completion times, maximum lateness, and number of tardy jobs.
-
common due window assignment and scheduling of linear time dependent deteriorating jobs and a deteriorating Maintenance Activity
International Journal of Production Economics, 2012Co-Authors: T C E Cheng, Suhjenq Yang, Darli YangAbstract:Due-window assignment and production scheduling are important issues in operations management. In this study we investigate the problem of common due-window assignment and scheduling of deteriorating jobs and a Maintenance Activity simultaneously on a single-machine. We assume that the Maintenance duration depends on its starting time. We provide polynomial time solutions for the problem and some of its special cases, where the objective is to simultaneously minimize the earliness, tardiness, due-window starting time, and due-window size costs.
Chuanli Zhao - One of the best experts on this subject based on the ideXlab platform.
-
single machine scheduling with multiple common due date assignment and aging effect under a deteriorating Maintenance Activity consideration
Journal of Applied Mathematics and Computing, 2014Co-Authors: Yanpeng Fan, Chuanli ZhaoAbstract:In this paper, we consider the multiple common due date assignment and single machine scheduling with a job-dependent aging effect and a deteriorating Maintenance Activity. Once the Maintenance Activity has been completed, the machine will revert to its initial condition and the aging effect will start anew, the Maintenance duration depends on its starting time. The objective is to minimize the total of earliness, tardiness, due date costs and find the optimal due date, the optimal Maintenance position. We introduce an efficient O(n4) algorithm to solve the problem. We also provide a special case of the problem and show that it remains polynomial time solvable.
