Journal of the Operations Research Society of Japan · 1982 · 12 citations · 2 references
Mathematical ProgrammingJob SchedulerOptimal SequenceEngineeringScheduling AnalysisIndustrial EngineeringScheduling ProblemProduction SchedulingOn N-jobLogisticsSystems EngineeringTransportation TimesScheduling (Production Processes)Scheduling (Computing)Minimum TotalCombinatorial OptimizationOperations Research
This short paper gives solution algorithm of obtaining an optimal sequence to give minimum total elapsed time in a 'n-job, 2-machine' flow-shop scheduling problem in which jobs involve Arbitrary Time Lags (i.e. Start Lags and Stop Lags) and Transportation Times. All the times (Processing Times, Arbitrary Lags, and Transportation times) are given prior and are of deterministic nature.
2
Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags
L. G. Mitten · Management Science · 1959 · 142 citations