Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
Open Access
- 3 August 2010
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 48 (2) , 399-421
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Tabu search for discrete–continuous scheduling problems with heuristic continuous resource allocationEuropean Journal of Operational Research, 2009
- Discrete–continuous project scheduling with discounted cash flows—A tabu search approachComputers & Operations Research, 2006
- Scheduling Malleable Tasks on Parallel Processors to Minimize the MakespanAnnals of Operations Research, 2004
- A heuristic approach to allocating the continuous resource in discrete-continuous scheduling problems to minimize the makespanJournal of Scheduling, 2002
- Project Scheduling under Discrete and Continuous Resources1999
- On a methodology for discrete–continuous schedulingEuropean Journal of Operational Research, 1998
- Project Scheduling under Resource Constraints1995
- Single machine scheduling problem with a common deadline and resource dependent release datesEuropean Journal of Operational Research, 1991
- Scheduling and Resource Allocation Problems in Some Flow Type Manufacturing Processes1991
- Project Scheduling with Continuously-Divisible, Doubly Constrained ResourcesManagement Science, 1981