On not-first/not-last conditions in disjunctive scheduling
Article Abstract:
Research is presented describing the study of disjunctive scheduling using the not-first/not-last task completion problem as a basis for the development of a constraint propagation algorithm.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
Article Abstract:
Research is presented describing the study of project scheduling on resource constrained schemes using heuristical based programming to evaluate problem solving.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
Heuristic programming
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
Subjects list: Operations research, Research, Management science, Study and teaching, Scheduling (Management)
Similar abstracts:
- Abstracts: Algodesk: an experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Abstracts: The utility efficient set and its interactive reduction. Optimal tax depreciation with uncertain future cash-flows
- Abstracts: A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
- Abstracts: Scheduling multiple variant programs under hard real-time constraint. A cutting plane algorithm for a single machine scheduling problem
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.