Minimizing the number of tardy jobs for the single machine scheduling problem : MIP-based lower and upper bounds

Cyril Briand and Samia Ourari

Year of publication:	2013
Authors:	Briand, Cyril ; Ourari, Samia
Published in:	RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 47.2013, 1, p. 33-46
Subject:	single machine scheduling \| tardy jobs \| dominance conditions \| mixed-integer programming \| Scheduling-Verfahren \| Scheduling problem \| Produktionssteuerung \| Production control \| Theorie \| Theory \| Heuristik \| Heuristics

Check Google Scholar |

More access options

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10010490676

A service of the