Minimizing flowtime for paired tasks

DOI10.1016/j.ejor.2016.10.012zbMath1402.90048OpenAlexW2537545913MaRDI QIDQ1751895

Brenda Courtad, Kenneth R. Baker, George G. Polak, Michael J. Magazine

Publication date: 25 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.10.012

zbMATH Keywords

heuristicsinteger programmingscheduling/batching

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (1)

A survey of job shop scheduling problem: the types and models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling a single server in a two-machine flow shop
• The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
• One-machine generalized precedence constrained scheduling problems
• Scheduling chains on a single machine with non-negative time lags
• Complexity results for single-machine problems with positive finish-start time-lags
• Scheduling with batching: A review
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Scheduling chains with identical jobs and constant delays on a single machine
• Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags
• On-line two-machine open shop scheduling with time lags
• Scheduling coupled tasks
• On the complexity of coupled-task scheduling

This page was built for publication: Minimizing flowtime for paired tasks