Three-stage flow-shop scheduling with assembly operations to minimize weighted sum of product completion times
Article Abstract:
A modified flow-shop scheduling problem for a production system, which is characterized by parts machining followed by their subsequent assembly (joining) is studied. Johnson's algorithm is used as part of the solution procedure to develop an efficient solution procedure with branch and bound method. The proposed solution is shown to be effective in obtaining optimal or e-optimal solutions for larger-scaled problems.
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:
Scheduling of continuous and discontinuous material flows with intermediate storage restrictions
Article Abstract:
Scheduling of continuous, discontinuous, and semi-continuous production process of process industries, like chemical, metal, pharmaceutical, or food industries, with limited resources and storage facilities is examined. Solution for production scheduling problem is analyzed in a branch-and-bound algorithm.
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:
Single machine scheduling under market uncertainty
Article Abstract:
A single machine scheduling method is developed using branch and bound theory to maximize net-present value and minimize processing time of industrial operation.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Scheduling about a given common due date to minimize mean squared deviation of completion times. Single machine scheduling with symmetric earliness and tardiness penalties
- Abstracts: Two-machine flow shop scheduling with two criteria: maximum earliness and makespan. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
- Abstracts: Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs. Scheduling for a multifunction phased array radar system
- Abstracts: Definition and properties of the input-weighted average lead-time. A short and mean-term automatic forecasting system - application to textile logistics
- Abstracts: Definition and properties of the input-weighted average lead-time. part 2 Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems