Cyclic scheduling of a hoist with time window constraints

Chen, Haoxun; Chen, Chu; Proth, Jean‐Marie

doi:10.1109/70.660860

Cited by 155 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Metaheuristics has been used to solve many combinatorial optimization challenges, which include the job shop scheduling problem [22], fuzzy job-shop scheduling problems [23], the capacitated vehicle routing problem with soft time windows [24], the fleet size and mix vehicle routing problem [25,26], a combination of assignment and transportation problems [27], bicriterion transportation problems [28], transportation for handicapped persons [29], the robust capacitated vehicle routing problem [30], distributed reentrant permutation flow shop scheduling [31], cumulative capacitated vehicles [32], multi-stage logistic chain networks [33], supply chain management [34], the dynamic technician routing and scheduling problem [35], a combination of vehicle routing and scheduling problems with time window constraints [36,37], cyclic scheduling of a hoist with time window constraints [38], and generalized assignment problems [10]. Metaheuristics involves the methods of finding a good solution within a reasonable computational time.…”

Section: Literature Reviewmentioning

confidence: 99%

Adaptive Large Neighborhood Search to Solve Multi-Level Scheduling and Assignment Problems in Broiler Farms

Praseeratasang

Pitakaso

Sethanan

et al. 2019

Journal of Open Innovation: Technology, Market, and Complexity

View full text Add to dashboard Cite

This research aimed to present a solution to the problem of production scheduling and assignment in broiler farms, which thus enabled the farms to achieve maximum profit. In the operation of farms, there are many factors that affect profits, such as the number of broilers being consistent with the demand of production plants, including profits from the sales and transportation costs. Therefore, we formulated a mathematical model and tested it while using three problem groups through the Lingo v.11 program. The results indicated that this mathematical model could find a suitable solution. However, finding the best solution had time constraints, which resulted in various other problems that prevented a search for an optimal solution due to time consumption exceeding 72 h. We developed an algorithm using the Adaptive Large Neighborhood Search (ALNS) method in order to find another possible solution using a shorter time period, which consisted of ALNS1, ALNS2, and ALNS3. These algorithms are based on a combination of the method of destruction solutions and methods accepting different solutions. We aimed to effectively solve the problems and ensure that they are appropriate for the case study, a broiler farm in Buriram. When comparing the algorithm efficiency with the Lingo v.11 program, it was found that the ALNS1 algorithm was the most suitable for finding the optimal solution in the shortest time, which resulted in a 5.74% increase in operating profits.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Adaptive Large Neighborhood Search to Solve Multi-Level Scheduling and Assignment Problems in Broiler Farms

Praseeratasang

Pitakaso

Sethanan

et al. 2019

Journal of Open Innovation: Technology, Market, and Complexity

View full text Add to dashboard Cite

show abstract

“…Congestion problems are not discussed in their research. Unlike cyclic hoist scheduling problems [4], [5], [6], the VCP problem deals with multiple vehicles running in a circular loop. These vehicles usually suffer from blocking effects due to the processing operations of their precedent vehicles.…”

Section: Fig 2 In-between Distances Of 10 Vehicles As Time Evolvesmentioning

confidence: 99%

Vehicle Clustering Phenomenon in Automatic Materials Handling Systems in 300mm Semiconductor Manufacturing

Liao

2006

MSF

View full text Add to dashboard Cite

During design and implementation of the automatic materials handling system (AMHS) for a local 300mm semiconductor wafer fab (semiconductor fabrication plant), we observed and found an interesting phenomenon Vehicle Clustering Phenomenon (VCP) from the dynamics of automated vehicles: As time evolves, the distance between any two adjacent vehicles usually becomes very close enough as if all the vehicles are a long train of vehicles running around the loop. The overall performance thus deteriorates due to this phenomenon. This paper explores the causes of the VCP problem and clarifies its impacts to automatic materials handling operations in 300mm semiconductor manufacturing.

show abstract

“…In interval robotic cells, each machine has a specific interval of time within which a part must be removed from that machine after its processing. This is applicable, for example, to the hoist scheduling problem on an electroplating line (Che et al 2002, Chen et al 1998, Lei and Wang 1994. In free-pickup cells, the part may remain on the machine for any amount of time after its processing is completed until the robot unloads it.…”

Section: Introductionmentioning

confidence: 99%

Approximations to Optimal k‐Unit Cycles for Single‐Gripper and Dual‐Gripper Robotic Cells

Geismar¹,

Chan²,

Dawande³

et al. 2008

Production and Operations Management

View full text Add to dashboard Cite

W e consider the problem of scheduling operations in bufferless robotic cells that produce identical parts using either single-gripper or dual-gripper robots. The objective is to find a cyclic sequence of robot moves that minimizes the long-run average time to produce a part or, equivalently, maximizes the throughput. Obtaining an efficient algorithm for an optimum k-unit cyclic solution (k ≥ 1) has been a longstanding open problem.For both single-gripper and dual-gripper cells, the approximation algorithms in this paper provide the bestknown performance guarantees (obtainable in polynomial time) for an optimal cyclic solution. We provide two algorithms that have a running time linear in the number of machines: for single-gripper cells (respectively, dual-gripper cells), the performance guarantee is 9/7 (respectively, 3/2). The domain considered is free-pickup cells with constant intermachine travel time. Our structural analysis is an important step toward resolving the complexity status of finding an optimal cyclic solution in either a single-gripper or a dual-gripper cell. We also identify optimal cyclic solutions for a variety of special cases. Our analysis provides production managers valuable insights into the schedules that maximize productivity for both single-gripper and dual-gripper cells for any combination of processing requirements and physical parameters.

show abstract

Cyclic scheduling of a hoist with time window constraints

Cited by 155 publications

References 7 publications

Adaptive Large Neighborhood Search to Solve Multi-Level Scheduling and Assignment Problems in Broiler Farms

Adaptive Large Neighborhood Search to Solve Multi-Level Scheduling and Assignment Problems in Broiler Farms

Vehicle Clustering Phenomenon in Automatic Materials Handling Systems in 300mm Semiconductor Manufacturing

Approximations to Optimal k‐Unit Cycles for Single‐Gripper and Dual‐Gripper Robotic Cells

Contact Info

Product

Resources

About