An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date
DOI10.3934/JIMO.2023139OpenAlexW4387756637MaRDI QIDQ6149341FDOQ6149341
Authors:
Publication date: 5 February 2024
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2023139
Recommendations
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- A novel B and B algorithm for a unrelated parallel machine scheduling problem to minimize the total weighted tardiness
- An exact quadratic programming approach based on convex reformulation for seru scheduling problems
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
release datebranch-and-boundtotal weighted tardinesssequence-dependent setup time\textit{seru} scheduling
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- A survey of scheduling problems with setup times or costs
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- The third comprehensive survey on scheduling problems with setup times/costs
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Single machine scheduling problem with a common deadline and resource dependent release dates
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
- Mathematical analysis and solutions for multi-objective line-cell conversion problem
- Modeling and numerical analysis of line-cell conversion problems
- An implementation framework for \(seru\) production
- Simulated annealing and genetic algorithm based method for a bi-level \textit{seru} loading problem with worker assignment in \textit{seru} production systems
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- Robust single machine makespan scheduling with release date uncertainty
- Attaining flexibility in seru production system by means of Shojinka: an optimization model and solution approaches
- Scheduling problem in seru production system considering DeJong's learning effect and job splitting
- Exact method based on solution space cut for bi-objective Seru production
- An exact quadratic programming approach based on convex reformulation for seru scheduling problems
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts
Cited In (1)
This page was built for publication: An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149341)
