The coupled task scheduling problem: an improved mathematical program and a new solution algorithm

DOI10.1111/itor.13240OpenAlexW4311481288MaRDI QIDQ6195035

Amir Salehipour, Mostafa Khatami

Publication date: 12 March 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13240

zbMATH Keywords

makespan minimizationbinary searchcoupled task schedulingrelax-and-solvemixed iteger programrelax-and-solve matheuristic

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• A fix-and-optimize heuristic for the high school timetabling problem
• A branch-and-bound algorithm for the coupled task problem
• Scheduling coupled-operation jobs with exact time-lags
• Identical coupled task scheduling: polynomial complexity of the cyclic case
• Scheduling of coupled tasks and one-machine no-wait robotic cells
• Interleaving two-phased jobs on a single machine
• Patient scheduling in hemodialysis service
• A meta-heuristic to solve the just-in-time job-shop scheduling problem
• Coupled task scheduling with time-dependent processing times
• An algorithm for single- and multiple-runway aircraft landing problem
• Coupled task scheduling with exact delays: literature review and models
• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
• Approximation algorithms for UET scheduling problems with exact delays
• A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
• Scheduling coupled tasks
• On the complexity of coupled-task scheduling
• A binary search algorithm for the general coupled task scheduling problem
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty

This page was built for publication: The coupled task scheduling problem: an improved mathematical program and a new solution algorithm