Satisfiability tests and time-bound adjustmentsfor cumulative scheduling problems

Author： Baptiste P.   Le Pape C.   Nuijten W.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.92, Iss.1, 1999-01, pp. : 305-333

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Open problems in real-time scheduling

By Baruah Sanjoy  

Journal of Scheduling, Vol. 13, Iss. 6, 2010-12 ,pp. : 577-582

Springer Publishing Company

Access to resources Recommend Favorite

Solving satisfiability problems with preferences

By Di Rosa Emanuele  

Constraints, Vol. 15, Iss. 4, 2010-10 ,pp. : 485-515

Springer Publishing Company

Access to resources Recommend Favorite

Time–Space Tradeoffs for Satisfiability

By Fortnow L.  

Journal of Computer and System Sciences, Vol. 60, Iss. 2, 2000-04 ,pp. : 337-353

Academic Press

Access to resources Recommend Favorite

Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems

By T'kindt V.   Croce F. Della   Esswein C.  

Journal of Scheduling, Vol. 7, Iss. 6, 2004-11 ,pp. : 429-440

Springer Publishing Company

Access to resources Recommend Favorite

Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm

By Achuthan N.R.   Hardjawidjaja A.  

Annals of Operations Research, Vol. 108, Iss. 1-4, 2001-11 ,pp. : 55-74

Springer Publishing Company

Access to resources Recommend Favorite