Greedy solutions of selection and ordering problems

European Journal of Operational Research

Volumn 134, Issue 1, 2001, Pages 203-215

  Alidaee, Bahram ^a   Kochenberger, Gary A ^a   Amini, Mohammad M ^b  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b UNIVERSITY OF MEMPHIS   (United States)

Author keywords

Analysis of algorithms; Heuristic algorithms; Optimality of greedy algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION MAKING; DECISION THEORY; DYNAMIC PROGRAMMING; FUNCTIONS; HEURISTIC METHODS;

GREEDY ALGORITHMS; MATROIDS;

OPERATIONS RESEARCH;

EID: 0035480431     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00252-6     Document Type: Article

References (21)

1. Selecting among scheduled projects
2. A dynamic priority rule for sequencing against due dates
3. Sequencing with earliness and tardiness penalties
4. A note on single-processor scheduling with time-dependent execution times
5. On the greedy solution of ordering problems
6. Job selection in a heavily loaded shops
7. Project selection and sequencing to maximize net present value of total return
8. Complexity of scheduling tasks with time dependent execution times
9. Implementing setup optimization on the shop floor
10. Greedoids - A structural framework for the greedy algorithm
11. The total tardiness problem: Review and extensions
12. Tabu search methods for a single machine scheduling problem
13. Integrating target analysis and Tabu search for improved scheduling systems
14. A heuristic to minimize the total weighted tardiness with sequence-dependent setups
15. Scheduling jobs on parallel machines with sequence-dependent setup times
16. A heuristic for single machine total tardiness problem
17. Selecting jobs for a heavily loaded shops with lateness penalties
18. Selecting jobs for scheduling on a machine subject to failure
19. Priority rules for job shops with weighted tardiness costs
20. Scheduling with time-dependent execution times