Greedy solutions of selection and ordering problems
From MaRDI portal
Publication:5945209
DOI10.1016/S0377-2217(00)00252-6zbMath0990.90565WikidataQ127865210 ScholiaQ127865210MaRDI QIDQ5945209
Bahram Alidaee, Mohammad M. Amini, Gary A. Kochenberger
Publication date: 10 October 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (8)
Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ Order acceptance with weighted tardiness ⋮ A branch and price solution approach for order acceptance and capacity planning in make-to-order operations ⋮ Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment ⋮ Order acceptance for motorail transportation with uncertain parameters ⋮ Order acceptance using genetic algorithms ⋮ Optimization of a highway project planning using a modified genetic algorithm ⋮ A matheuristic for the generalized order acceptance and scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Scheduling with time-dependent execution times
- Greedoids
- Scheduling jobs on parallel machines with sequence-dependent setup times
- A heuristic for the single machine tardiness problem
- Complexity of scheduling tasks with time-dependent execution times
- Job selection in a heavily loaded shop
- Selecting among scheduled projects
- A note on single-processor scheduling with time-dependent execution times
- Selecting jobs for scheduling on a machine subject to failure
- Selecting jobs for heavily loaded shop with lateness penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- On the Greedy Solution of Ordering Problems
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- Implementing Setup Optimization on the Shop Floor
- The Total Tardiness Problem: Review and Extensions
This page was built for publication: Greedy solutions of selection and ordering problems