Results 211 to 215 of about 4,494 (215)
Some of the next articles are maybe not open access.
Makespan minimization form parallel identical processors
Naval Research Logistics, 1995Summary: We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule.
Johnny Wong, Johnny C. Ho
openaire +3 more sources
Makespan distribution of permutation flowshop schedules
Journal of Scheduling, 2008The makespan distribution of permutation flowshop schedules has been a topic of debate for almost fifty years. Many researchers have confirmed or doubted the famous claim that the makespan distribution of permutation flowshop schedules is asymptotically normal if the number of jobs is sufficiently large.
Feng Jin +3 more
openaire +2 more sources
Supply Chain Scheduling: Makespan reduction potential
International Journal of Logistics Research and Applications, 2012Specialization, concentration on core competencies, and increasing globalization lead to a situation where competition between big national companies is increasingly replaced by competition between globally operating supply chains (Christopher, 1992; Cooper et al., 1997; Handfield and Nichols, 1999; Barnes, 2006; Vandaele et al., 2007; Stadtler, 2008).
openaire +2 more sources