A two-bottleneck system with binomial yields and rigid demand
Article Abstract:
A multistage production system producing in lots with two stages having a non-zero setup costs is examined. The stages with non-zero setup costs are referred to as bottlenecks. As it is a production in lots, the production policy has to specify at which stage to produce next and the number of units to be processed. A solution is offered by using linear equations for developing a fixed production policy.
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:
Optimal timing of a sequence of tasks with general completion costs
Article Abstract:
A dynamic programming algorithm for optimal scheduling of a sequence of tasks in a single-machine situation is presented duly considering the costs associated with the time taken for each task and also the costs associated with idle time of the machine.
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:
- Abstracts: Single bottleneck systems with proportional expected yields and rigid demand. Lot-sizing two-echelon assembly systems with random yields and rigid demand
- Abstracts: Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands. Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- Abstracts: A tabu search Hooke and Jeeves algorithm for unconstrained optimization. A modified Hooke and Jeeves algorithm with likelihood ratio performance extrapolation for simulation optimization
- Abstracts: Production scheduling in a flexible manufacturing system under random demand. Resolution of a scheduling problem in a flowshop robotic cell
- Abstracts: Rendezvous search on the line with bounded resources: expected time minimization. A goal programming approach to group decision making based on multiplicative preference relations and fuzzy preference relations