A worker constrained flexible job shop scheduling problem with sequence-dependent setup times

Kreß, Dominik; Müller, David; Nossack, Jenny

doi:10.1007/s00291-018-0537-z

Cited by 44 publications

(11 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the type of setup time, Refs. [6,14,18,22,24,30,34] consider the family job sequencedependent setup time; Refs. [19,28] consider two types of setup time, but machines do not have multiple patterns; others consider the job sequence-dependent setup time.…”

Section: Hfs With Sequence-dependent Setup Time (Hfs-sdst)mentioning

confidence: 99%

See 1 more Smart Citation

Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times

Yong

et al. 2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper considers the hybrid flow shop scheduling problem with two types of sequence-dependent setup times, one depending on the order of jobs and the other depending on both the order of jobs and the machines where the jobs are allocated. Three constructive heuristic algorithms based on the NEH algorithm are developed with the object of minimizing the total energy consumption cost. The first algorithm, called EPRA, obtains the order of jobs using the energy consumption cost based on the processing time. The second algorithm, called ESRA, obtains the order of jobs using the energy consumption cost based on the setup time. The third algorithm, called ESPRA, takes advantage of both EPRA and ESRA by constructing fictitious jobs with ESRA and acquiring the sequence of fictitious jobs with EPRA. Due to the drawback of NEH algorithm for the FFS problem proposed in this paper, all three heuristic algorithms use EST rules to allocate the jobs to the machines. Two lower bounds are developed to evaluate the heuristic algorithms proposed in this paper. A computational experiment based on the split-plot design is developed to carry out the factor analysis, algorithm analysis, lower bounds analysis, and CPU running time analysis. The analysis reveals that all main factor interactions except the algorithm are significant; the ESPRA algorithm is generally outstanding among the three algorithms; LB1 is better than LB2; the CPU running time of ESPRA algorithm is significantly reduced compared to those of EPRA and ESST algorithms.

show abstract

Section: Hfs With Sequence-dependent Setup Time (Hfs-sdst)mentioning

confidence: 99%

“…For the algorithm, most of them propose intelligent algorithms to solve this problem [6-25, 27-29, 31, 33, 35]. Fewer focus on heuristics [26,28,[30][31][32]34]. ere is only one paper that focused on exact algorithm [36].…”

Section: Hfs With Sequence-dependent Setup Time (Hfs-sdst)mentioning

confidence: 99%

Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times

Yong

et al. 2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Third phase fixes the solution destructed in the second phase, while the fourth phase uses a descend neighborhood search to find the final solution. Paper [33] describes minimizing makespan and total tardiness for a flexible JSSP with sequence-dependent setup times that account for machine operators qualifications. The authors developed both exact branch-and-cut algorithm and a heuristic-based approach.…”

Section: Cyclic and Flexible Productionmentioning

confidence: 99%

A Parallel Algorithm for Scheduling a Two-Machine Robotic Cell in Bicycle Frame Welding Process

Gnatowski

Niżyński

2021

Applied Sciences

View full text Add to dashboard Cite

Welding frames with differing geometries is one of the most crucial stages in the production of high-end bicycles. This paper proposes a parallel algorithm and a mixed integer linear programming formulation for scheduling a two-machine robotic welding station. The time complexity of the introduced parallel method is O(log2n) on an n3-processor Exclusive Read Exclusive Write Parallel Random-Access Machine (EREW PRAM), where n is the problem size. The algorithm is designed to take advantage of modern graphics cards to significantly accelerate the computations. To present the benefits of the parallelization, the algorithm is compared to the state of art sequential method and a solver-based approach. Experimental results show an impressive speedup for larger problem instances—up to 314 on a single Graphics Processing Unit (GPU), compared to a single-threaded CPU execution of the sequential algorithm.

show abstract

“…To make the problem more tractable, we propose a decomposition scheme in the spirit of logic-based and combinatorial Benders decomposition (Codato and Fischetti 2006;Hooker 2007), which has seen success dealing with difficult combinatorial optimization problems (e.g., Kress et al 2019;Tadumadze et al 2020;Fang et al 2021;Huang et al 2021). The general idea consists of splitting the original problem into a master and a slave component.…”

Section: Logic-based Benders Decomposition For the Picker Routing Problemmentioning

confidence: 99%

New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot

et al. 2021

View full text Add to dashboard Cite

This paper develops new solution procedures for the order picker routing problem in U-shaped order picking zones with a movable depot, which has so far only been solved using simple heuristics. The paper presents the first exact solution approach, based on combinatorial Benders decomposition, as well as a heuristic approach based on dynamic programming that extends the idea of the venerable sweep algorithm. In a computational study, we demonstrate that the exact approach can solve small instances well, while the heuristic dynamic programming approach is fast and exhibits an average optimality gap close to zero in all test instances. Moreover, we investigate the influence of various storage assignment policies from the literature and compare them to a newly derived policy that is shown to be advantageous under certain circumstances. Secondly, we investigate the effects of having a movable depot compared to a fixed one and the influence of the effort to move the depot.

show abstract

A worker constrained flexible job shop scheduling problem with sequence-dependent setup times

Cited by 44 publications

References 38 publications

Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times

Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times

A Parallel Algorithm for Scheduling a Two-Machine Robotic Cell in Bicycle Frame Welding Process

New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot

Contact Info

Product

Resources

About