On the N-Job, One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution

Autor:	Shwimer, Joel
Zdroj:	Management Science, 1972 Feb 01. 18(6), B301-B313.
Databáze:	JSTOR Journals
Externí odkaz:	https://www.jstor.org/stable/2629258 Zobrazit plný text záznamu