Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
From MaRDI portal
Publication:2060398
DOI10.1016/j.ejor.2021.06.017zbMath1490.90143OpenAlexW3171873908WikidataQ114902448 ScholiaQ114902448MaRDI QIDQ2060398
Zhe Zhang, Xiaoling Song, Xiaoyang Zhou, Huijung Huang, Yong Yin
Publication date: 13 December 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.06.017
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items
Scheduling problem in seru production system considering DeJong's learning effect and job splitting, Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility, Column generation for service assignment in cloud-based manufacturing, Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights, An exact quadratic programming approach based on convex reformulation for seru scheduling problems, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, The stochastic pseudo-star degree centrality problem, An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts, An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date, Maximizing the throughput of a rotating Seru with nonpreemptive discrete stations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- Scheduling jobs with a general learning effect model
- Minimizing the total completion time in a single-machine scheduling problem with a learning effect
- An effective architecture for learning and evolving flexible job-shop schedules
- A state-of-the-art review of parallel-machine scheduling research
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Single-machine scheduling with learning considerations
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- A Benders decomposition-based framework for solving quay crane scheduling problems
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects
- Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times
- Analysis of the effect of the line-\textit{seru} conversion on the waiting time with batch arrival
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Mathematical analysis and solutions for multi-objective line-cell conversion problem
- A survey of scheduling problems with setup times or costs
- A state-of-the-art review on scheduling with learning effects
- Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study
- Modeling and numerical analysis of line-cell conversion problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- An implementation framework for seru production
- Solution strategies for multi-stage wafer probing scheduling problem with reentry