Scheduling UET-UCT outforests to minimize maximum lateness
Article Abstract:
A machine scheduling problem with parallel processors, precedence constraints that is completing of task one before beginning task two, unit execution time and unit completion time is examined. Solution aimed at finding a method for minimizing the criterion of maximum lateness is demonstrated through approximation algorithms.
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:
A review of planning and scheduling systems and methods for integrated teel production
Article Abstract:
Research is presented describing the development of a production process analysis method for use in scheduling and planning integrated process in the iron and steel industry.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
User Contributions:
Comment about this article or add new information about this topic:
Scheduling tasks on moving executors to minimize the maximum lateness
Article Abstract:
Research is presented describing the development of an optimization manufacturing methods for complex operation systems in executor-moving environments.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Retail marketing: from distribution to integration. Research for product positioning and design decisions: an integrative review
- Abstracts: Adaptive policies, policy analysis, and policy-making. A new resolution method for the parametric linear complementarity problem
- Abstracts: Cigarette advertising and consumption in the United States: 1961-1990. Beer brand advertising and market share in the United States: 1977 to 1998
- Abstracts: Johri's general dual, the Lagrangian dual, and the surrogate dual. A Lagrangian relaxation approach to the edge-weighted clique problem