On project scheduling with irregular starting time costs

Operations Research Letters

Volumn 28, Issue 4, 2001, Pages 149-154

  Möhring, Rolf H ^a   Schulz, Andreas S ^b   Stork, Frederik ^a   Uetz, Marc ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Integer programming; Minimum cut; Minimum weight closure; Network flow; Project scheduling; Scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

BRANCH-AND-BOUND METHOD;

OPERATIONS RESEARCH;

EID: 0035329641     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00064-5     Document Type: Article

References (34)

1. Solving the convex cost integer dual network flow problem
2. On a selection problem
3. Scheduling projects with labor constraints
4. The poset scheduling problem
5. Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem
6. Project scheduling with resource constraints: A branch and bound approach
7. Scheduling tasks with due dates in a fabrication/assembly process
8. A network flow computation for project cost curves
9. Beyond the flow decomposition barrier
10. A new approach to the maximum-flow problem
11. Optimal subtrees and extensions
12. The project scheduling problem with a separable convex cost function
13. Polynomial methods for separable convex optimization in unimodular linear spaces with applications
14. Critical path planning and scheduling: Mathematical basis
15. The project scheduling problem with irregular starting time costs
16. The poset scheduling problem
17. Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems
18. Solving the project time/cost tradeoff problem using the minimal cut concept
19. Maximal closure of a graph and applications to combinatorial problems
20. Multi project scheduling with limited resources: A zero-one programming approach
21. A selection problem of shared fixed costs and network flows
22. A price-directed approach to real-time scheduling of production operations
23. Cash flows in networks
24. A strong fractional cutting-plane algorithm for resource-constrained project scheduling