Minimizing total completion time subject to release dates and sequence-dependent processing times
From MaRDI portal
Recommendations
- Scheduling tasks with sequence-dependent processing times
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
- Scheduling with controllable release dates and processing times: total completion time minimization
- Scheduling with release dates on a single machine to minimize total weighted completion time
Cited in
(20)- An algorithm for single- and multiple-runway aircraft landing problem
- On-line decision support for take-off runway scheduling with uncertain taxi times at London heathrow airport
- Lessons from building an automated pre-departure sequencer for airports
- Heuristics for flights arrival scheduling at airports
- Aircraft landing problems with aircraft classes
- Airport runway scheduling
- Minimizing deviation from scheduled times in a single mixed-operation runway
- Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- A new intelligent approach for air traffic control using gravitational search algorithm
- The aircraft runway scheduling problem: a survey
- Scheduling tasks with sequence-dependent processing times
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- A dynamic programming approach for the aircraft landing problem with aircraft classes
- An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems
- Scheduling models for air traffic control in terminal areas
- Enhanced models for a mixed arrival-departure aircraft sequencing problem
- An optimal data-splitting algorithm for aircraft sequencing on a single runway
- scientific article; zbMATH DE number 91757 (Why is no real title available?)
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
This page was built for publication: Minimizing total completion time subject to release dates and sequence-dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290157)
