Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains

Jula, Payman; Kones, Ishai

doi:10.1080/00207543.2012.757666

Cited by 10 publications

(5 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The objective was to minimise a cost function based on earliness, weighted number of tardy jobs, job holding, due date assignment, batch delivery, makespan and resource consumption. Jula and Kones (2013) addressed the problem of selecting and scheduling several jobs on a single machine with sequence-dependent set-up times and strictly enforced time-window constraints on the start time of each job. They introduced a two-step mathematical programming model based on disjunctive constraints to solve problems.…”

Section: Literature Reviewmentioning

confidence: 99%

A hybrid particle swarm optimisation for scheduling just-in-time single machine with preemption, machine idle time and unequal release times

Seidgar

Abedi

Tadayonirad

et al. 2014

International Journal of Production Research

View full text Add to dashboard Cite

This paper addresses preemption in just-in-time (JIT) single-machine-scheduling problem with unequal release times and allowable unforced machine idle time as realistic assumptions occur in the manufacturing environments aiming to minimise the total weighted earliness and tardiness costs. Delay in production systems is a vital item to be focussed to counteract lost sale and back order. Thus, JIT concept is targeted including the elements required such as machine preemption, machine idle time and unequal release times. We proposed a new mathematical model and as the problem is proven to be NP-hard, three meta-heuristic approaches namely hybrid particle swarm optimisation (HPSO), genetic algorithm and imperialist competitive algorithm are employed to solve the problem in larger sizes. In HPSO, cloud theorybased simulated annealing is employed with a certain probability to avoid being trapped in a local optimum. Taguchi method is applied to calibrate the parameters of the proposed algorithms. A number of numerical examples are solved to demonstrate the effectiveness of the proposed approach. The performance of the proposed algorithms is evaluated in terms of relative percent deviation and computational time where the computational results clarify better performance of HPSO than other algorithms in quality of solutions and computational time.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A hybrid particle swarm optimisation for scheduling just-in-time single machine with preemption, machine idle time and unequal release times

Seidgar

Abedi

Tadayonirad

et al. 2014

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…Jula and Kones (2013) consider the problem of selecting and scheduling several jobs on a single machine with sequence-dependent set-up times and strictly enforced time window constraints on the start time of each job. We conduct this study to plug the research gap.…”

Section: Review Of Related Researchmentioning

confidence: 99%

A multi-objective scatter search for the ladle scheduling problem

Tan

Cheng

2014

International Journal of Production Research

View full text Add to dashboard Cite

We consider the ladle scheduling problem, which can be regarded as a vehicle routing problem with semi-soft time windows and adjustment times. The problem concerns allocating ladles to serve molten steel based on a given steelmaking scheduling plan, and determining the modification operations for the empty ladles after the service process. In addition, combining the controllable processing time of molten steel, the other aspect of the problem is to determine the service start times taking into consideration the technological constraints imposed in practice. We present a non-linear mathematical programming model with the conflicting objectives of minimising the occupation ratio of the ladles and maximising the degree of satisfaction with meeting the soft windows. To solve the multi-objective model, we develop a new scatter search (SS) approach by re-designing the common components of SS and incorporating a diversification generator, a combination method and a diversification criterion to conduct a wide exploration of the search space. We analyse and compare the performance of the proposed approach with a multi-objective genetic algorithm and with manual scheduling adopted in practical production using three real-life instances from a well-known iron-steel production plant in China. The computational results demonstrate the effectiveness of the proposed SS approach for solving the ladle scheduling problem.

show abstract

“…The studies by Sarimveis et al (2008) and Harjunkoski et al (2014) showed a wide range of advantages regarding the application of CT models in combination with other techniques to production and logistics. They include, first of all, a non-stationary process view and accuracy of continuous time (Chen et al 2012, Jula andKones 2013). In addition, a wide range of analysis tools from CT regarding stability, controllability, adaptability, etc.…”

Section: State-of-the-artmentioning

confidence: 99%

Robust dynamic schedule coordination control in the supply chain

Ivanov

Dolgui

Sokolov

2016

Computers & Industrial Engineering

View full text Add to dashboard Cite

International audienceCoordination plays crucial role in supply chain management. In this paper, we extend the existing body of literature on supply chain coordination by representing a robust schedule coordination approach. A hybrid discrete/continuous flow shop supply chain with job shop processes at each supplier stage is studied. For this purpose, the developed scheduling model comprises operations control (for customer order fulfillment dynamics), channel control (production machine and transportation dynamics), resource control (material supply dynamics), and flow control (processing and shipment dynamics) with multiple objectives. Based on the scheduling model, we introduce a robust analysis of schedule coordination in the presence of disruptions in capacities and supply. The application of attainable sets opens a possibility to analyse schedule coordination dynamics under disruptions. The results provide insights of how to integrate the coordination issues into schedule robustness analysis. We exemplify the developed approach for the case of two-stage supply chain coordination, and derive managerial insights for both considered scheduling problem and application of dynamic control methods to supply chain coordination in general

show abstract

Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains

Cited by 10 publications

References 40 publications

A hybrid particle swarm optimisation for scheduling just-in-time single machine with preemption, machine idle time and unequal release times

A hybrid particle swarm optimisation for scheduling just-in-time single machine with preemption, machine idle time and unequal release times

A multi-objective scatter search for the ladle scheduling problem

Robust dynamic schedule coordination control in the supply chain

Contact Info

Product

Resources

About