scientific article; zbMATH DE number 91757
From MaRDI portal
Publication:4017560
Recommendations
- scientific article; zbMATH DE number 40477
- Efficient heuristics to minimize total flow time with release dates
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- On the asymptotic optimality of algorithms for the flow shop problem with release dates
- Minimizing Mean Flow Time With Release Time and Deadline Constraints
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Minimizing total completion time subject to release dates and sequence-dependent processing times
- scientific article; zbMATH DE number 3843476
Cited in
(35)- Scheduling with release dates on a single machine to minimize total weighted completion time
- Efficient heuristics to minimize total flow time with release dates
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem
- An iterative heuristic for the single machine dynamic total completion time scheduling problem
- \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
- Dominance-based heuristics for one-machine total cost scheduling problems
- Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
- Minimizing total tardiness on a single machine with unequal release dates
- Algorithms for single-machine scheduling problem with deterioration depending on a novel model
- Two very large-scale neighborhoods for single machine scheduling
- ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- A hybrid heuristic approach for single machine scheduling with release times
- A mixed integer programming approach for the single machine problem with unequal release dates
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- Single machine batch scheduling with release times and delivery costs
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- Minimizing Mean Flow Time With Release Time and Deadline Constraints
- A single-machine scheduling with a truncated linear deterioration and ready times
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
- Target-oriented robust satisficing models for the single machine scheduling problems with release time
- Fifty years of research in scheduling -- theory and applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017560)
