Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison

DOI10.1080/02522667.1984.10698788zbMath0543.90062OpenAlexW2000758545MaRDI QIDQ3332755

Vijay Aggarwal, K. R. Kalra, P. C. Bagga

Publication date: 1984

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1984.10698788

zbMATH Keywords

computational complexityoptimal schedulecomputational comparisonoptimal algorithmstotal elapsed timetransportation times2\(\times n\) sequencingblock processing restriction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal two- and three-stage production schedules with setup times included
• Mathematical aspects of the 3 × n job-shop sequencing problem

This page was built for publication: Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison