Parallel Machine Scheduling with Resources Constraint and Sequence Dependent Setup Times

Hou, Zheng-liang; Guo, Xiuping

doi:10.1007/978-3-642-33012-4_80

Cited by 2 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some important research has been done in parallel machine environment considering different assumptions such as resource constraints (Hou, 2013), sequence-dependent setup times (Hou, 2013), machine eligibility constraint in automotive gear industry (Gokhale & Mathirajan, 2012), single batch delivery of production by vehicles in a supply chain (Cakici, Mason, Geismar, & Fowler, 2014), and acceptance or rejection possibility of jobs in order to minimize total penalty cost from rejections and make-span of accepted jobs (Zhang, Lu, & Yuan, 2009). Mokhtari and Abadi (Mokhtari & Abadi, 2013) designed a Non-Linear Programming (NLP) model to solve a single-stage scheduling problem with outsourcing option with the aim of total cost minimization.…”

Section: Literature Reviewmentioning

confidence: 99%

A robust just-in-time flow shop scheduling problem with outsourcing option on subcontractors

Goli

Tirkolaee

Soltani

2019

Production & Manufacturing Research

View full text Add to dashboard Cite

Scheduling is known as a great part of production planning in manufacturing systems. Flow Shop Scheduling (FSS) problem deals with the determination of the optimal sequence of jobs processing on machines in a fixed order. This paper addresses a novel robust FSS problem with outsourcing option where jobs can be either scheduled for inside or outsourced to one of the available subcontractors. Capacity limitation for inside resource, just-in-time delivery policy and uncertain processing time are the key assumptions of the proposed model. The objective is to minimize the total-weighted time required to complete all jobs and the total cost of outsourcing. So, a Robust Mixed-Integer Linear Programming (RMILP) model is proposed to accommodate the problem with the real-world conditions. Finally, the obtained results show the effects of the robustness in optimizing the model under uncertainty condition. Moreover, the comparison analysis demonstrated the superiority of our proposed model against the previous Non-Linear Programming (NLP) model in the literature. ARTICLE HISTORY

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A robust just-in-time flow shop scheduling problem with outsourcing option on subcontractors

Goli

Tirkolaee

Soltani

2019

Production & Manufacturing Research

View full text Add to dashboard Cite

show abstract

“…Kellerer and Strusevisch [20] showed that the two-machine problem with one additional resource type is NP-hard. Hou and Guo [19] proposed an MIP model of parallel machine scheduling with resource constraints and sequence-dependent setup times, which was also reported to be NP-hard. Another crucial constraint of the addressed problem is the capacitated battery constraint.…”

Section: Model Descriptionmentioning

confidence: 99%

Task scheduling system for UAV operations in indoor environment

Khosiawan

Park

Moon

et al. 2018

Neural Comput & Applic

View full text Add to dashboard Cite

The application of unmanned aerial vehicle (UAV) in indoor environment is emerging nowadays due to the advancements in technology. UAV brings more space flexibility in an occupied or hardly accessible indoor environment, e.g. shop floor of manufacturing industry, greenhouse, and nuclear powerplant. UAV helps in creating an autonomous manufacturing system by executing tasks with less human intervention in a time-efficient manner. Consequently, a scheduler is an essential component to be focused on; yet the number of reported studies on UAV scheduling has been minimal. This work proposes a mathematical model of the problem and a heuristic-based methodology to solve it. To suit near real-time operations, a quick response towards uncertain events and a quick creation of new high-quality feasible schedule are needed. Hence, the proposed heuristic is incorporated with particle swarm optimization algorithm to find a near optimal schedule in a short computation time. This proposed methodology is implemented into a scheduler and tested on a few scales of datasets generated based on real flight demonstrations. Performance evaluation of scheduler is discussed in detail, and the best solution obtained from a selected set of parameters is reported.

show abstract

Parallel Machine Scheduling with Resources Constraint and Sequence Dependent Setup Times

Cited by 2 publications

References 14 publications

A robust just-in-time flow shop scheduling problem with outsourcing option on subcontractors

A robust just-in-time flow shop scheduling problem with outsourcing option on subcontractors

Task scheduling system for UAV operations in indoor environment

Contact Info

Product

Resources

About