An exact block algorithm for no-idle RPQ problem

DOI10.1515/acsc-2017-0021zbMath1448.90044OpenAlexW2724309976MaRDI QIDQ4971711

Jaroslaw Pempera

Publication date: 12 October 2020

Published in: Archives of Control Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/acsc-2017-0021

zbMATH Keywords

schedulingsingle machineno-idleB{\&}B algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines

Cites Work

• A block approach for single-machine scheduling with release dates and due dates
• The one-machine sequencing problem
• A fast tabu search algorithm for the permutation flow-shop problem
• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
• Note: On the two-machine no-idle flowshop problem
• New block properties for the permutation flow shop problem with application in tabu search
• Mathematical Description of Linear Dynamical Systems

This page was built for publication: An exact block algorithm for no-idle RPQ problem