Approximability of two-machine no-wait flowshop scheduling with availability constraints

Cheng, T.C.E.; Liu, Zhaohui

doi:10.1016/s0167-6377(02)00230-4

Cited by 35 publications

(16 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[21,22,31,32,35] for some references on the problem for different settings). Most of the works on flowshops are restricted to the 2-machine case (see [5,7,8,10,11,24,36,37]), and only [2][3][4]28] consider the case for more than 3 machines. Aside, in these works, availability constraints are represented by windows or holes, i.e.…”

mentioning

confidence: 99%

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

González

2009

Computers & Operations Research

View full text Add to dashboard Cite

In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may not be available at the beginning of the planning period, due to processing of previously scheduled jobs. We first formulate the problem, analyse the structure of solutions depending on a number of factors (such as machines, jobs, structure of the processing times, availability vectors, etc.), and compare it with its classical counterpart. Results indicate that the problem under consideration presents a different structure of solutions, and that it is easier than the classical permutation flowshop problem. In view of these results, we propose and test a number of fast heuristics for the problem.

show abstract

mentioning

confidence: 99%

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

González

2009

Computers & Operations Research

View full text Add to dashboard Cite

show abstract

“…Schmidt [21] reviewed deterministic scheduling problems with availability constraints. Espinouse et al [22] and Cheng and Liu [23] investigated a two-machine flow-shop problem in a no-wait environment with availability constraint. Liao and Chen [24] considered several maintenance periods in their single-machine scheduling problem, which minimizes the maximum tardiness of jobs.…”

Section: -1 Integration Of Maintenance and General Production Problemsmentioning

confidence: 99%

Developing Simulation Based Optimization Mechanism for Novel Stochastic Reliability Centered Maintenance Problem

2017

View full text Add to dashboard Cite

This research investigates joint scheduling of maintenance and production planning. This novel integrated problem takes benefit of reliability-centered maintenance (RCM) for monitoring and managing maintenance function of a stochastic complex production-planning problem namely flexible job shop scheduling problem (FJSP). The developed RCM works based on stochastic shocking of machines during their process time. In fact, it implements condition based maintenance approach regulated according to stochastic reliability concept. Comparison of the system reliability with critical levels determines the failure statues of the machines. It activates two main types of reaction called preventive and corrective maintenance. Considering breakdown of the system between inspection intervals makes the proposed model more realistic. Moreover, maintenance activity times and their duration are considered stochastically. Because of the high complexity level for this joint system, simulation-based optimization (SBO) approach is proposed for solving the problem. This SBO searches the feasible area through genetic algorithm (GA) and biogeography based optimization (BBO) algorithm. Different test problems, statistical methods, novel visualizations are used to discuss the problem and the algorithm explicitly.

show abstract

“…Potts for useful discussions. The comments from the Associate Editor and two anonymous referees have contributed to the clarity of presentation and have drawn our attention to paper [4].…”

Section: Acknowledgmentmentioning

confidence: 99%

“…For the problem with a single hole, Espinouse et al give a 2-approximation algorithm [5,6]; this result has been improved by Wang and Cheng [16], who provide a 5/3-approximation algorithm. Recently, Cheng and Liu [4] have developed a polynomial-time approximation scheme for that problem.…”

Section: Introductionmentioning

confidence: 99%

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

Kubzin

Strusevich

2004

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:We study a two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst-case ratio of 3/2. For the second scenario, we offer a 4/3-approximation algorithm.

show abstract

Approximability of two-machine no-wait flowshop scheduling with availability constraints

Cited by 35 publications

References 5 publications

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Developing Simulation Based Optimization Mechanism for Novel Stochastic Reliability Centered Maintenance Problem

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

Contact Info

Product

Resources

About