A general lower bound for the makespan problem
Article Abstract:
The NP-hard problem of reducing makespan in the scheduling of tasks on identical parallel machines is considered. Specifically, two conditions for evaluating the optimality of the longest process time law are obtained and used to derive a general lower bound for the optimal solution of the problem. The bound may be extended to derive new bounds, enhance known bounds and adapted to problems with variable processor ready times.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Minimizing overhead for some tree-scheduling problems
Article Abstract:
The problem of scheduling trees-shaped precedence task graphs was considered within the framework of an execution model proposed by R.J. Anderson, P. Beame and M. Snir. Specifically, the model was employed to prove that minimizing the overhead in scheduling trees of depth three on m processor is NP-complete. Based on this proof, a polynomial time algorithm for generating optimal schedules for complete trees was developed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Minimizing the schedule length for a parallel 3D-grid precedence graph
Article Abstract:
The problem of scheduling the tasks of a parallel program on MIMD computers is considered. Specifically, several parallel algorithms for executing 3D grid preference graphs of size n on p = O(n) processors that takes into account the overhead or tradeoff between the communications and idle time are examined. Consequently, it is found that a schedule with an overhead of O(5/3) is developed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Stuttgart digs deep for cathedral for the train. Controlling the unknown for towering achievement. Nervi's mastery of art in reinforced concrete. (Concrete Quarterly)
- Abstracts: An enlightened shop window for dynamic design. Silver screens for steel town
- Abstracts: Too close to the hedge: the case of Long Term Capital Management LP, part 2: near collapse and rescue. Takeover frenzy in telecoms: the case of MCI WorldCom
- Abstracts: Out of tune: piano maker Samick tried for the business big leagues, but drowned in a sea of debt. Its failure is a stark reminder of the obstacles South Korea's small and mid-sized companies face
- Abstracts: The application of fuzzy integrals in multicriteria decision making. Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower