Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
From MaRDI portal
Publication:2147050
DOI10.1016/j.cor.2022.105787OpenAlexW4220695277MaRDI QIDQ2147050
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105787
Related Items
Cites Work
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Mathematical programming formulations for machine scheduling: A survey
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- A time indexed formulation of non-preemptive single machine scheduling problems
- Two twin-\(T\) based op amp oscillations modified for chaos
- Structure of a simple scheduling polyhedron
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- Exact algorithms for the traveling salesman problem with draft limits
- A survey of scheduling problems with setup times or costs
- Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
- An algorithm for the single machine sequencing problem with precedence constraints
- Single-Machine Scheduling Polyhedra with Precedence Constraints
- Scheduling
