An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production

Li, Wei; Nault, Barrie R.; Xue, Deyi; Tu, Yiliu

doi:10.1016/j.cor.2010.05.002

Cited by 25 publications

(10 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Off-line scheduling, considered an open-loop strategy may not be robust enough to handle these changes. The proposed approach can be incorporated into a closed-loop solution that implements an integrated scheduling and control scheme (Li et al 2011;Lin and Lee 1997) different instances of off-line scheduling, taken into account the current shop floor status. The following procedure requires an interface with the control system.…”

Section: Resultsmentioning

confidence: 99%

A coloured Petri net-based hybrid heuristic search approach to simultaneous scheduling of machines and automated guided vehicles

Baruwa

Piera

2015

International Journal of Production Research

View full text Add to dashboard Cite

To achieve a significant improvement in the overall performance of a flexible manufacturing system, the scheduling process must consider the interdependencies that exist between the machining and transport systems. However, most works have addressed the scheduling problem as two independent decision making problems, assuming sufficient capacity in the transport system. In this paper, we study the simultaneous scheduling (SS) problem of machines and automated guided vehicles using a timed coloured Petri net (TCPN) approach under two performance objectives; makespan and exit time of the last job. The modelling approach allows the evaluation of all the feasible vehicle assignments as opposed to the traditional dispatching rules and demonstrates the benefits of vehicle-controlled assignments over machine-controlled for certain production scenarios. In contrast with the hierarchical decomposition technique of existing approaches, TCPN is capable of describing the dynamics and evaluating the performance of the SS problem in a single model. Based on TCPN modelling, SS is performed using a hybrid heuristic search algorithm to find optimal or near-optimal schedules by searching through the reachability graph of the TCPN with heuristic functions. Large-sized instances are solved in relatively short computation times, which were a priori unsolvable with conventional search algorithms. The algorithm's performance is evaluated on a benchmark of 82 test problems. Experimental results indicate that the proposed algorithm performs better than the conventional ones and compares favourably with other approaches.

show abstract

Section: Resultsmentioning

confidence: 99%

A coloured Petri net-based hybrid heuristic search approach to simultaneous scheduling of machines and automated guided vehicles

Baruwa

Piera

2015

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…The PDRs are FCFS, SPT, LPT and the most work following (MWF) rule. The heuristics are NEH (Nawaz, Enscore, and Ham 1983), CDS (Campbell, Dudek, and Smith 1970), state-space (SS) (Li et al 2011), and state space-average processing time (SS-APT) (Li and Freiheit 2015). The NEH, CDS, SS and SS-APT heuristics have demonstrated high performance in traditional and hybrid flow-shop production scheduling problems (Botta-Genoulaz 2000; Li and Freiheit 2015;Ruiz and Maroto 2005).…”

Section: Scheduling Methodsmentioning

confidence: 98%

“…This can result in uneven workflow on production lines, for example on production lines for customised windows and doors (Li et al 2011), on meat processing lines (Christensen et al 2000), or for operating room scheduling (Chow et al 2011). Two typical metrics driving manufacturing system performance evaluation are utilisation of production lines and work-in-process (WIP) inventory levels (Pinedo 2012).…”

Section: Introductionmentioning

confidence: 99%

The effect of work content imbalance and its interaction with scheduling method on sequential flow line performance

Freiheit

2016

International Journal of Production Research

Self Cite

View full text Add to dashboard Cite

Uneven workflow in serial flow lines is common when job work content varies. Unfortunately, work content imbalance between stations or between jobs degrades system performance. The effect of this imbalance can be mitigated by proper job sequencing. In this paper, we uncouple the influence of station-to-station and job-to-job imbalance within a set of jobs, introducing metrics to quantify the degree of imbalance, and determine their impact on line performance. We then examine the sensitivity of several scheduling methods at different problem scales and processing time variance levels, and compare the sensitivity to process time stability radii. Within the case studies explored, we determine that greater station imbalance can degrade solution quality regardless of problem scale and variance level. Greater job imbalance can either improve or diminish solution quality (i.e. relative performance from a given scheduling method), but less than station imbalance. Scheduling methods that sequence jobs based on the sums of processing times, e.g. SPT, can benefit from greater station imbalance. Scheduling methods that sequence jobs based on idle time between stations, e.g. the state-space heuristic, are more sensitive to station imbalance, but can also benefit from job imbalance. Finally, we conclude that job sequence has a greater impact on solution quality than stability radii.

show abstract

“…In regards to three criteria of optimality, computational complexity, and flexibility to evaluate a heuristic for adaptive production control (Li et al, 2011a), the state space (SS) heuristic is the better than most existing heuristics. For optimality, SS heuristic outperforms the most popular alternative heuristics (CDS, NIS) against Taillard's benchmarks no matter for Fm/prmu/C max , Fm/nwt/C max , FFs/nwt/C max and FFs/FCFS/C max problems.…”

Section: Discussionmentioning

confidence: 99%

“…Three main criteria are used to evaluate a heuristic for adaptive production scheduling and control (Li et al, 2011a): optimality, computational complexity, and flexibility. Usually optimality is used to evaluate a heuristic for offline production scheduling.…”

Section: Three Criteriamentioning

confidence: 99%

Adaptive Production Scheduling and Control in One-Of-A-Kind Production

Li¹,

Tu²

2012

Production Scheduling

Self Cite

View full text Add to dashboard Cite

An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production

Cited by 25 publications

References 24 publications

A coloured Petri net-based hybrid heuristic search approach to simultaneous scheduling of machines and automated guided vehicles

A coloured Petri net-based hybrid heuristic search approach to simultaneous scheduling of machines and automated guided vehicles

The effect of work content imbalance and its interaction with scheduling method on sequential flow line performance

Adaptive Production Scheduling and Control in One-Of-A-Kind Production

Contact Info

Product

Resources

About