Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags

DOI10.1007/BF00121674zbMath0866.90072OpenAlexW2023456012MaRDI QIDQ2564876

Jatinder N. D. Gupta

Publication date: 7 January 1997

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00121674

zbMATH Keywords

single machine schedulingworst-case analysisNP-hardnesstime-lagsmultiple operationspolynomially bounded heuristic algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Identical coupled task scheduling: polynomial complexity of the cyclic case ⋮ Scheduling of coupled tasks and one-machine no-wait robotic cells ⋮ Minimizing flowtime for paired tasks

Cites Work

• Optimal two- and three-stage production schedules with setup times included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling

This page was built for publication: Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags