A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization

Walid Hfaiedh, Chérif Sadfi, Imed Kacem, Atidel Hadj-Alouane

Source record

Source: Crossref

Published: Feb 1, 2015

DOI: 10.1016/j.amc.2014.11.103

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.