Greedy solutions of selection and ordering problems
From MaRDI portal
Recommendations
- On the Greedy Solution of Ordering Problems
- scientific article; zbMATH DE number 3871387
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
- Optimization under ordinal scales: When is a greedy solution optimal?
- A simple greedy algorithm for a class of shuttle transportation problems
Cites work
- A heuristic for the single machine tardiness problem
- A note on single-processor scheduling with time-dependent execution times
- Complexity of scheduling tasks with time-dependent execution times
- Greedoids
- scientific article; zbMATH DE number 3871387 (Why is no real title available?)
- Implementing Setup Optimization on the Shop Floor
- Job selection in a heavily loaded shop
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- On the Greedy Solution of Ordering Problems
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Scheduling with time-dependent execution times
- Selecting among scheduled projects
- Selecting jobs for heavily loaded shop with lateness penalties
- Selecting jobs for scheduling on a machine subject to failure
- Sequencing with Earliness and Tardiness Penalties: A Review
- The Total Tardiness Problem: Review and Extensions
Cited in
(11)- Order acceptance using genetic algorithms
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Order acceptance for motorail transportation with uncertain parameters
- A matheuristic for the generalized order acceptance and scheduling problem
- On the Greedy Solution of Ordering Problems
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
- Optimization of a highway project planning using a modified genetic algorithm
- Simultaneous eating algorithm and greedy algorithm in assignment problems
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- A simple greedy algorithm for a class of shuttle transportation problems
- Order acceptance with weighted tardiness
This page was built for publication: Greedy solutions of selection and ordering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945209)