Lower bounds for single‐machine scheduling problems

No abstract is available for this paper.

• Publication year

  1990

• Venue

  Naval Research Logistics

• Publication date

  1990-12-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1002/1520-6750(199012)37:6<967::AID-NAV3220370616>3.0.CO;2-K
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Minimizing Weighted Completion Times with Deadlines

  1985cited by this paper
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time

  1983cited by this paper
• Scheduling of a single machine to minimize total weighted completion time subject to release dates

  1982cited by this paper
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time

  1981cited by this paper
• On n/1/F̄ dynamic deterministic problems

  1979cited by this paper
• Complexity of machine scheduling problems

  1975cited by this paper
• Introduction to sequencing and scheduling

  1974cited by this paper
• Various optimizers for single‐stage production

  1956cited by this paper

• Theoretical approaches and special cases for a single machine with release dates to minimize four criterion

  2021cites this paper
• Minimizing the Total Weighted Waiting Times and Instability in a Rescheduling Problem with Dynamic Jobs Weight

  2021cites this paper
• Exact Solutions for Minimizing cost Function with Five Criteria and Release Dates on Single Machine

  2020cites this paper
• Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates

  2019cites this paper
• A branch and bound algorithm for solving large-scale single-machine scheduling problems with non-identical release dates

  2018cites this paper
• Extensions of the Basic Model

  2018cites this paper
• A New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time

  2015cites this paper
• A mixed integer programming approach for the single machine problem with unequal release dates

  2014cites this paper
• Genetic local search algorithm for minimizing the total completion time in single machine scheduling problem with release dates and precedence constraints

  2013cites this paper
• A new lower bound for minimising the total completion time in a two-machine flow shop under release dates

  2013cites this paper
• Approximation Algorithms for Minimizing Sum of Flow Time on a Single Machine with Release Dates

  2012cites this paper
• Single Machine Scheduling

  2011cites this paper
• Extensions of the Basic Model

  2009cites this paper
• A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates

  2009cites this paper
• Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop

  2009cites this paper
• Two very large-scale neighborhoods for single machine scheduling

  2007cites this paper
• Efficiency of Local Search

  2006cites this paper
• ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME

  2004cites this paper
• Minimizing total flow time in single machine environment with release time: an experimental analysis

  2004influential citation
• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem

  2003cites this paper
• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem

  2002cites this paper
• Scheduling with target start times

  2001cites this paper
• A Review of Machine Scheduling: Complexity, Algorithms and Approximability

  1998cites this paper
• Heuristic approaches for n/m/F/ ∑Ci scheduling problems

  1997cites this paper
• A new class of scheduling criteria and their optimization

  1996cites this paper
• Efficient heuristic and optimal approaches for n/2/F/[sigma]Ci scheduling problems

  1996cites this paper
• Approximability and nonapproximability results for minimizing total flow time on a single machine

  1996cites this paper
• A branch‐and‐bound algorithm to minimize total flow time with unequal release dates

  1992cites this paper
• Heuristic approaches for C i scheduling problems

  year unknowncites this paper