z-logo
open-access-imgOpen Access
Tight lower bounds by semidefinite relaxation for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs
Author(s) -
Céline Gicquel,
Abdel Lisser,
Michel Minoux
Publication year - 2012
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - changeover , sizing , scheduling (production processes) , mathematical optimization , sequence (biology) , computer science , job shop scheduling , relaxation (psychology) , semidefinite programming , mathematics , schedule , telecommunications , art , social psychology , psychology , transmission (telecommunications) , biology , visual arts , genetics , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom