Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs

DOI10.1111/itor.12503OpenAlexW2778603107MaRDI QIDQ6066713

No author found.

Publication date: 16 November 2023

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

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

zbMATH Keywords

branch-and-bound algorithmmultiprocessor jobsoptima localization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Mixed coordination mechanisms for scheduling games on hierarchical machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The worst-case time complexity for generating all maximal cliques and computational experiments
• On the complexity of adjacent resource scheduling
• Scheduling for parallel processing
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth planning problem
• Efficiency and effectiveness of normal schedules on three dedicated processors
• A typology of cutting and packing problems
• Two-dimensional packing problems: a survey
• On minimizing dataset transfer time in an acyclic network with four servers
• Adjacent-Resource Scheduling
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• Handbook on Scheduling

This page was built for publication: Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs