On-line and semi-online scheduling for flow shop problems on two machines

ISSN： 0233-1934

Source： Optimization, Vol.62, Iss.4, 2013-04, pp. : 499-507

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

Semi-online scheduling on two identical machines with rejection

By Min Xiao Wang Yuqing Liu Jing Jiang Min

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 472-479

Springer Publishing Company

Access to resources Recommend Favorite

Semi-online scheduling with known maximum job size on two uniform machines

By Cao Qian Liu Zhaohui

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 369-384

Springer Publishing Company

Access to resources Recommend Favorite

Semi-online scheduling with “end of sequence” information

By Epstein Leah Ye Deshi

Journal of Combinatorial Optimization, Vol. 14, Iss. 1, 2007-07 ,pp. : 45-61

Springer Publishing Company

Access to resources Recommend Favorite

Semi-online scheduling for jobs with release times

By Li Rongheng Yang Liying He Xiaoqiong Chen Qiang Cheng Xiayan

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 448-464

Springer Publishing Company

Access to resources Recommend Favorite

Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times

By Liu Ming Chu Chengbin Xu Yinfeng Zheng Feifeng

Journal of Combinatorial Optimization, Vol. 21, Iss. 1, 2011-01 ,pp. : 138-149

Springer Publishing Company

Access to resources Recommend Favorite