Results 181 to 190 of about 23,190 (193)
Some of the next articles are maybe not open access.

Makespan distribution of permutation flowshop schedules

Journal of Scheduling, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin, Feng   +3 more
openaire   +1 more source

Minimizing Makespan with Bimodal Processing Time Distributions

Management Science, 1981
We consider the problem of scheduling n tasks on two identical parallel processors. Task i has a processing time of one time unit, but might have to undergo processing for a second time unit with probability pi, i.e., the processing time distributions of the tasks have mass only on one and on two.
openaire   +2 more sources

Makespan Optimization in Open Shop Scheduling

2019
In today’s rapid production scenario, scheduling plays a dynamic role in planning. In this work, open shop scheduling problem related to a copper flexible braids manufacturing company is considered. In a scheduling problem, the purpose is to find the orders of jobs on specific machines with an objective to optimize the makespan.
Prakash Kesarawani   +2 more
openaire   +1 more source

Makespan

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

Makespan Scheduling

2010
Frank Neumann, Carsten Witt
openaire   +1 more source

Stepwise Comparison for Minimizing Controller Makespan

2023 IEEE 13th International Conference on Control System, Computing and Engineering (ICCSCE), 2023
Yuki Shimizu   +3 more
openaire   +1 more source

Makespan

2013
openaire   +1 more source

Home - About - Disclaimer - Privacy