Advanced search
Publication Cover
IIE Transactions Volume 33, 2001 - Issue 8
Submit an article Journal homepage
98
Views
24
CrossRef citations to date
0
Altmetric
TECHNICAL NOTE

Scheduling jobs with release dates and deadlines on a batch processing machine

T.C. EDWIN CHENG Department of Management, The Hong Kong Polytechnic University, Kowloon, Hong Kong, China E-mail: [email protected]
,
ZHAOHUI LIU Department of Management, The Hong Kong Polytechnic University, Kowloon, Hong Kong, China E-mail: [email protected]; Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China
&
WENCI YU Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China
Pages 685-690 | Accepted 01 Oct 2000, Published online: 27 Apr 2007

Citations (24)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

A. Tamer Ünal, Semra Ağralı & Z. Caner Taşkın. (2020) A strong integer programming formulation for hybrid flowshop scheduling. Journal of the Operational Research Society 71:12, pages 2042-2052.
Read now

Articles from other publishers (23)

Jinwen Ou, Lingfa Lu & Xueling Zhong. (2023) Parallel-batch scheduling with rejection: Structural properties and approximation algorithms. European Journal of Operational Research 310:3, pages 1017-1032.
Crossref
Evgeny R. Gafarov & Alexandre Dolgui. (2022) On lower and upper bounds for single machine parallel batch scheduling. Optimization Letters 16:9, pages 2557-2567.
Crossref
Yuan Gao. (2021) Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times. Asia-Pacific Journal of Operational Research 39:02.
Crossref
Xiaofang Zhao & Shuguang Li. (2022) A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions. Electronic Research Archive 30:11, pages 4209-4219.
Crossref
Miaomiao Jin, Xiaoxia Liu & Wenchang Luo. (2020) Single-Machine Parallel-Batch Scheduling with Nonidentical Job Sizes and Rejection. Mathematics 8:2, pages 258.
Crossref
Chenchen Fu, Vincent Chau, Minming Li & Chun Jason Xue. (2017) Race to idle or not: balancing the memory sleep time with DVS for energy minimization. Journal of Combinatorial Optimization 35:3, pages 860-894.
Crossref
Cheng He, Joseph Y.-T. Leung, Kangbok Lee & Michael L. Pinedo. (2016) Scheduling a single machine with parallel batching to minimize makespan and total rejection cost. Discrete Applied Mathematics 204, pages 150-163.
Crossref
Cuixia Miao, Yuzhong Zhang & Cuilian Wu. (2012) Scheduling of deteriorating jobs with release dates to minimize the maximum lateness. Theoretical Computer Science 462, pages 80-87.
Crossref
Baoqiang Fan, Jinjiang Yuan & Shisheng Li. (2012) Bi-criteria scheduling on a single parallel-batch machine. Applied Mathematical Modelling 36:3, pages 1338-1346.
Crossref
A. Bellanger, A. Janiak, M.Y. Kovalyov & A. Oulamara. (2012) Scheduling an unbounded batching machine with job processing time compatibilities. Discrete Applied Mathematics 160:1-2, pages 15-23.
Crossref
L.L. Liu, C.T. Ng & T.C.E. Cheng. (2010) On scheduling unbounded batch processing machine(s). Computers & Industrial Engineering 58:4, pages 814-817.
Crossref
Lili Liu, Jibo Wang & Feng Zhang. (2009) Scheduling jobs on parallel batch processing machines. Scheduling jobs on parallel batch processing machines.
L.L. Liu, C.T. Ng & T.C.E. Cheng. (2009) Scheduling jobs with release dates on parallel batch processing machines. Discrete Applied Mathematics 157:8, pages 1825-1830.
Crossref
Frédéric Ridouard, Pascal Richard & Patrick Martineau. (2008) On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan. European Journal of Operational Research 189:3, pages 1327-1342.
Crossref
Lingfa Lu & Jinjiang Yuan. (2008) Unbounded parallel batch scheduling with job delivery to minimize makespan. Operations Research Letters 36:4, pages 477-480.
Crossref
Lingfa Lu, Liqi Zhang & Jinjiang Yuan. (2008) The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoretical Computer Science 396:1-3, pages 283-289.
Crossref
Jinjiang Yuan, Xianglai Qi, Lingfa Lu & Wenhua Li. (2008) Single machine unbounded parallel-batch scheduling with forbidden intervals. European Journal of Operational Research 186:3, pages 1212-1217.
Crossref
L.L. Liu, C.T. Ng & T.C.E. Cheng. (2007) Scheduling jobs with agreeable processing times and due dates on a single batch processing machine. Theoretical Computer Science 374:1-3, pages 159-169.
Crossref
Wenhua Li & Jinjiang Yuan. (2006) Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost. International Journal of Production Economics 102:1, pages 143-148.
Crossref
T.C.E. Cheng, J.J. Yuan & A.F. Yang. (2005) Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Computers & Operations Research 32:4, pages 849-859.
Crossref
T.C.E. Cheng, C.T. Ng, J.J. Yuan & Z.H. Liu. (2004) Single machine parallel batch scheduling subject to precedence constraints. Naval Research Logistics (NRL) 51:7, pages 949-958.
Crossref
J.J. Yuan, Z.H. Liu, C.T. Ng & T.C.E. Cheng. (2004) The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theoretical Computer Science 320:2-3, pages 199-212.
Crossref
Zhaohui Liu, Jinjiang Yuan & T.C.Edwin Cheng. (2003) On scheduling an unbounded batch machine. Operations Research Letters 31:1, pages 42-48.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.