A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
Article Abstract:
A mathematical model that provides solution for flexible flow shops with branching, bounding and propagation of constraints that minimize the make span of a schedule and the mean flow time is presented.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
Germany, Hungary, Usage, Mathematical models, Shop floor control, Multiprocessing, Shop floor control software
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
The shortest path problem with forbidden paths
Article Abstract:
Two solutions for constrained shortest path problem are presented. The constraints comprise of forbidden paths.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
Canada, Analysis, Production planning, Critical path analysis
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
Subjects list: Methods
Similar abstracts:
- Abstracts: A preemptive priority queue with balking. Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline
- Abstracts: Incomplete information and multiple machine queueing problems
- Abstracts: Definition and properties of the input-weighted average lead-time. part 2 Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.