Pre-Emptive Scheduling Problems with Controllable Processing Times

Author： Shakhlevich Natalia   Strusevich Vitaly  

Publisher： Springer Publishing Company

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.8, Iss.3, 2005-06, pp. : 233-253

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

Pre-emptive versus non-pre-emptive real time scheduling in intelligent mobile robotics

By Piaggio Maurizio   Sgorbissa Antonio   Zaccaria Renato  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 12, Iss. 2, 2000-04 ,pp. : 235-245

Taylor & Francis Ltd

Access to resources Recommend Favorite

A single machine scheduling problem with common due window and controllable processing times

By Liman S.D.   Panwalkar S.S.   Thongmee S.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 145-154

Springer Publishing Company

Access to resources Recommend Favorite

Single machine scheduling with total tardiness criterion and convex controllable processing times

By Xu Kailiang   Feng Zuren   Ke Liangjun  

Annals of Operations Research, Vol. 186, Iss. 1, 2011-06 ,pp. : 383-391

Springer Publishing Company

Access to resources Recommend Favorite

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

By Davis Robert   Burns Alan  

Real-Time Systems, Vol. 47, Iss. 1, 2011-01 ,pp. : 1-40

Springer Publishing Company

Access to resources Recommend Favorite

Single-machine scheduling problems with time and position dependent processing times

By Zhang Xingong   Yan Guangle   Huang Wanzhen   Tang Guochun  

Annals of Operations Research, Vol. 186, Iss. 1, 2011-06 ,pp. : 345-356

Springer Publishing Company

Access to resources Recommend Favorite