Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times

Nesello, Vitor; Subramanian, Anand; Battarra, Maria; Laporte, Gilbert

doi:10.1016/j.ejor.2017.10.020

Cited by 30 publications

(9 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The schedule result obtained by the LPT rule is (10,9,8,7,6,5,4 Likewise, jobs 8 and 2 will be arranged to the third availability interval by…”

Section: Numerical Experimentsmentioning

confidence: 99%

“…A single machine scheduling problem with periodic maintenance and sequence-dependent set-up times was analyzed by Pacheco et al [8], and an efficient variable neighborhood search approach with memory was proposed. Nesello et al [9] proposed new arctime index formulations for scheduling with periodic maintenances and given a simple iterative exact algorithm. Perez-Gonzalez and Framinan [10] developed single machine scheduling models with cyclical machine availability periods, and proposed new heuristics based on bin packing assignment rules.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time

Shen¹,

Zhu²

2020

IJCIS

View full text Add to dashboard Cite

A single machine scheduling problem with periodic maintenance is studied in this paper. Due to many uncertainties in reality, the processing time is recognized as an uncertain variable. The aim is to minimize the makespan at a confidence level. An uncertain chance-constrained programming model is developed to delve into the impact of uncertainties on decision variables, and an algorithm for calculating the objective function is proposed. According to the theoretical analysis, a novel method named longest shortest processing time (LSPT) rule is proposed. Subsequently, an improved genetic algorithm (GA-M) combined with LSPT rule is proposed. Numerical experiments are used to verify the feasibility of this model and algorithm.

show abstract

“…The schedule result obtained by the LPT rule is (10,9,8,7,6,5,4 Likewise, jobs 8 and 2 will be arranged to the third availability interval by…”

Section: Numerical Experimentsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time

Shen¹,

Zhu²

2020

IJCIS

View full text Add to dashboard Cite

show abstract

“…In typical scheduling problems, a prespecified set of jobs with known processing times has to be allocated to one or several machines with the objective to minimize some function of the schedule such as the makespan (see, e.g, Pinedo, 2016). An important class of problems features sequence-dependent setup times, i.e., the setup time of a job depends on the previous job (see, e.g., Nesello et al, 2018;Shen et al, 2018). An important assumption is that setup times are deterministic for a given job sequence.…”

Section: Introductionmentioning

confidence: 99%

Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs

Broek

Heide

Foreest

2020

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Wang et al 11 developed a single-machine scheduling model with flexible periodic maintenance and proposed a branch-andprice (BP) algorithm for the problem. Nesello et al 12 presented mathematical models for the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times and developed an iterative exact algorithm. According to the results of extensive computational experiments, the proposed algorithm outperforms the existing one.…”

Section: Introductionmentioning

confidence: 99%

A parallel-machine scheduling with periodic constraints under uncertainty

Shen

Zhu

2019

Advances in Mechanical Engineering

View full text Add to dashboard Cite

Most studies on scheduling problem have assumed that the machine is continuously available. However, the machine is likely to be unavailable for many practical reasons (e.g. breakdown and planned preventive maintenance). Once a machine is not available, the optimal scheme in the deterministic scenario may not be the optimal choice. To address the actual scenario, a scheduling problem with two identical parallel machines, one of which requires periodic maintenance, is considered in this article. For uncertainties in reality, the processing and maintenance time are considered as uncertain variables. A novel method to study the worst-case ratio in an uncertain scenario is proposed. It is shown that the worst-case ratio of the longest processing time algorithm is 3/2 at a high confidence level. Given theoretical analysis results, an modified algorithm is proposed. Finally, numerical experiments are used to verify the feasibility of the modified algorithm.

show abstract

Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times

Cited by 30 publications

References 27 publications

A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time

A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time

Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs

A parallel-machine scheduling with periodic constraints under uncertainty

Contact Info

Product

Resources

About