Advanced search
Publication Cover
A I I E Transactions Volume 12, 1980 - Issue 3
Journal homepage
115
Views
172
CrossRef citations to date
0
Altmetric
Original Articles

Two Single Machine Sequencing Problems Involving Controllable Job Processing Times

R. G. Vickson Department of Management Sciences, University of Waterloo Waterloo, Ontario, Canada, N2L 3G1
Pages 258-262 | Received 01 Nov 1979, Published online: 06 Jul 2007

Citations (172)

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 (28)

Junfeng Ren & Yang Yang. (2022) Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine. Engineering Optimization 54:11, pages 1819-1834.
Read now
Yujing Jiang, Zhe Zhang, Xiaoling Song & Yong Yin. (2022) Scheduling controllable processing time jobs in seru production system with resource allocation. Journal of the Operational Research Society 73:11, pages 2551-2571.
Read now
Daniel Oron. (2019) Batching and resource allocation decisions on an m-machine proportionate flowshop. Journal of the Operational Research Society 70:9, pages 1571-1578.
Read now
Imène Benkalai, Djamal Rebaine & Pierre Baptiste. (2019) Scheduling flow shops with operators. International Journal of Production Research 57:2, pages 338-356.
Read now
Moshe Zofi, Ron Teller & Moshe Kaspi. (2017) Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times. Journal of the Operational Research Society 68:10, pages 1177-1182.
Read now
Jiao Li, Xiao Li & Wenchang Luo. (2016) Single-Machine Scheduling with Discretely Controllable Job Processing Times Subject to a Deteriorating Rate-Modifying Activity. American Journal of Mathematical and Management Sciences 35:3, pages 194-206.
Read now
Du-Juan Wang, Yunqiang Yin & Mengqi Liu. (2016) Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity. International Journal of Production Research 54:12, pages 3691-3705.
Read now
Hui Zhu, Min Li, Zhangjin Zhou & Yun You. (2016) Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity. International Journal of Production Research 54:12, pages 3475-3490.
Read now
Cheng-Hsiang Liu & Wan-Ni Tsai. (2016) Multi-objective parallel machine scheduling problems by considering controllable processing times. Journal of the Operational Research Society 67:4, pages 654-663.
Read now
Lu Liu, Jian-Jun Wang & Xiao-Yuan Wang. (2016) Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost. International Journal of Production Research 54:4, pages 1186-1195.
Read now
Kai Li, Shan-lin Yang, Joseph Y.-T. Leung & Ba-yi Cheng. (2015) Effective meta-heuristics for scheduling on uniform machines with resource-dependent release dates. International Journal of Production Research 53:19, pages 5857-5872.
Read now
Xinle Liang, Huaping Chen & Rui Xu. (2015) Approximately optimal algorithms for scheduling a single machine with general convex resource functions. International Journal of Computer Integrated Manufacturing 28:9, pages 920-935.
Read now
Dar-Li Yang, T.C.E. Cheng & Suh-Jenq Yang. (2014) Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions. International Journal of Production Research 52:4, pages 1133-1141.
Read now
D Oron. (2014) Scheduling controllable processing time jobs in a deteriorating environment. Journal of the Operational Research Society 65:1, pages 49-56.
Read now
Y Yin, T C E Cheng, C-C Wu & S-R Cheng. (2014) Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time. Journal of the Operational Research Society 65:1, pages 1-13.
Read now
Yunqiang Yin, T.C.E. Cheng, Chin-Chia Wu & Shuenn-Ren Cheng. (2013) Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times. International Journal of Production Research 51:17, pages 5083-5099.
Read now
Hsin-Tao Lee & Suh-Jenq Yang. (2012) Parallel machines scheduling with deterioration effects and resource allocations. Journal of the Chinese Institute of Industrial Engineers 29:8, pages 534-543.
Read now
Kai Li, Shan-Lin Yang & Ming-Lun Ren. (2011) Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption. International Journal of Systems Science 42:10, pages 1811-1820.
Read now
Hadi Mokhtari, Isa Nakhai Kamal Abadi & Ali Cheraghalikhani. (2011) A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources. International Journal of Production Research 49:19, pages 5851-5875.
Read now
Andreas C. Nearchou. (2010) Scheduling with controllable processing times and compression costs using population-based heuristics. International Journal of Production Research 48:23, pages 7043-7062.
Read now
Dvir Shabtay, Moshe Kaspi & George Steiner. (2007) The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times. IIE Transactions 39:5, pages 539-557.
Read now
C T Daniel Ng, T C E Cheng & M Y Kovalyov. (2003) Batch scheduling with controllable setup and processing times to minimize total completion time. Journal of the Operational Research Society 54:5, pages 499-506.
Read now
X. D. Qi, G. Yin & J. R. Birge. (2002) Single machine scheduling with randomly compressible processing times. Stochastic Analysis and Applications 20:3, pages 591-613.
Read now
X.D. Qi, G. Yin & J.R. Birge. (2000) Single–machine scheduling with random machine breakdowns and randomly compressible processing times. Stochastic Analysis and Applications 18:4, pages 635-653.
Read now
DIRK BISKUP & T. C. EDWIN CHENG. (1999) SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND EARLINESS, TARDINESS AND COMPLETION TIME PENALTIES. Engineering Optimization 31:3, pages 329-336.
Read now
SELCUK KARABATI & PANAGIOTIS KOUVELIS. (1997) Flow-line scheduling problem with controllable processing times. IIE Transactions 29:1, pages 1-14.
Read now
T.C.E. CHENG, Z.L. CHEN & CHUNG-LUN LI. (1996) Parallel-machine scheduling with controllable processing times. IIE Transactions 28:2, pages 177-180.
Read now
ABDULHAKIM HALIM, SHIGEJI MIYAZAKI & HIROSHI OHTA. (1994) Lot scheduling problems of multiple items in the shop with both receiving and delivery just in time. Production Planning & Control 5:2, pages 175-184.
Read now

Articles from other publishers (144)

Ke Chen, T.C.E. Cheng, Hailiang Huang, Min Ji & Danli Yao. (2023) Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs. European Journal of Operational Research 309:1, pages 24-34.
Crossref
Xinyu Sun, Xin-Na Geng, Jiayin Wang & Lei Pan. (2023) Slack due window assignment scheduling in the single-machine with controllable processing times. Journal of Industrial and Management Optimization 0:0, pages 0-0.
Crossref
Seho Yim, Sung-Pil Hong, Myoung-Ju Park & Yerim Chung. (2022) Inverse interval scheduling via reduction on a single machine. European Journal of Operational Research 303:2, pages 541-549.
Crossref
Shijin Wang, Ruochen Wu, Feng Chu & Jianbo Yu. (2022) Unrelated parallel machine scheduling problem with special controllable processing times and setups. Computers & Operations Research 148, pages 105990.
Crossref
Ali Kordmostafapour, Javad Rezaeian, Iraj Mahdavi & Mahdi Yar Farjad. (2022) Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost. OPSEARCH 59:4, pages 1438-1470.
Crossref
Abraham P. Punnen. 2022. The Quadratic Unconstrained Binary Optimization Problem. The Quadratic Unconstrained Binary Optimization Problem 1 37 .
Li Sun, Xiao-hong Zhang & Lei Ning. (2021) Results of Parallel-Machine Scheduling Model with Maintenance Activity considering Time-Dependent Deterioration, Delivery Times, and Resource Allocation. Mathematical Problems in Engineering 2021, pages 1-14.
Crossref
Bahram Alidaee, Haitao Li, Haibo Wang & Keith Womer. (2021) Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension. Omega 103, pages 102446.
Crossref
Gur Mosheiov, Daniel Oron & Amir Salehipour. (2021) Coupled task scheduling with convex resource consumption functions. Discrete Applied Mathematics 293, pages 128-133.
Crossref
Baruch Mor, Dvir Shabtay & Liron Yedidsion. (2021) Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times. Computers & Industrial Engineering 153, pages 107024.
Crossref
Li Sun, Bin Wu & Lei Ning. (2021) Parallel-Machine Scheduling with DeJong’s Learning Effect, Delivery Times, Rate-Modifying Activity, and Resource Allocation. Shock and Vibration 2021, pages 1-10.
Crossref
Chengxin Luo & Geng Zhang. (2020) Single Machine Scheduling Problem with Controllable Setup and Job Processing Times and Position-Dependent Workloads. IOP Conference Series: Materials Science and Engineering 790:1, pages 012093.
Crossref
Imène Benkalai, Djamal Rebaine & Pierre Baptiste. (2020) Scheduling job shop problems with operators with respect to the maximum lateness. RAIRO - Operations Research 54:2, pages 555-568.
Crossref
敏 刘. (2020) The Scheduling Problem of Single Job with Time Windows. Advances in Applied Mathematics 09:12, pages 2161-2165.
Crossref
Siwen Liu. 2020. Complexity and Approximation. Complexity and Approximation 252 267 .
Chang Zhongxiang, Chen Yuning, Yang Wenyuan & Zhou Zhongbao. (2019) Analysis of Mission Planning Problem for Video Satellite Imaging with Variable Imaging Duration. Analysis of Mission Planning Problem for Video Satellite Imaging with Variable Imaging Duration.
Bahram Alidaee, Haibo Wang, R. Bryan Kethley & Frank Landram. (2019) A unified view of parallel machine scheduling with interdependent processing rates. Journal of Scheduling 22:5, pages 499-515.
Crossref
Xinle Liang, Shengchao Zhou, Huaping Chen & Rui Xu. (2019) Pseudo transformation mechanism between resource allocation and bin-packing in batching environments. Future Generation Computer Systems 95, pages 79-88.
Crossref
Dujuan Wang & Zhiwu Li. (2019) Bicriterion scheduling with a negotiable common due window and resource-dependent processing times. Information Sciences 478, pages 258-274.
Crossref
Meng Wei, Yu Yang, Jiafu Su, Qiucheng Li & Zhichao Liang. (2019) Task Reallocating for Responding to Design Change in Complex Product Design. Journal of Intelligent Systems 28:1, pages 57-76.
Crossref
Imene Benkalai, Djamal Rebaine & Pierre Baptiste. (2019) On the impact of the number of operators in a flow shop environment. IFAC-PapersOnLine 52:13, pages 2798-2803.
Crossref
Chuang Liu, Huaping Chen, Rui Xu & Yu Wang. (2018) Minimizing the resource consumption of heterogeneous batch-processing machines using a copula-based estimation of distribution algorithm. Applied Soft Computing 73, pages 283-305.
Crossref
Akiyoshi Shioura, Natalia V. Shakhlevich & Vitaly A. Strusevich. (2018) Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. European Journal of Operational Research 266:3, pages 795-818.
Crossref
Weifan Huang, Chin-Chia Wu & Shangchia Liu. (2018) Single-machine batch scheduling problem with job rejection and resource dependent processing times. RAIRO - Operations Research 52:2, pages 315-334.
Crossref
Dvir Shabtay & Moshe Zofi. (2018) Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan. International Journal of Production Economics 198, pages 191-200.
Crossref
Xinna Geng, Jibo Wang & Chou-Jung Hsu. (2018) Flow Shop Scheduling Problem with Convex Resource Allocation and Learning Effect. Journal of Computer and Communications 06:01, pages 239-246.
Crossref
Han Zhonghua, Zhu Boqiu, Lin Hao & Gong Wei. 2018. Recent Developments in Mechatronics and Intelligent Robotics. Recent Developments in Mechatronics and Intelligent Robotics 164 171 .
Liron Yedidsion & Dvir Shabtay. (2017) The resource dependent assignment problem with a convex agent cost function. European Journal of Operational Research 261:2, pages 486-502.
Crossref
Hui Zhu & Yun You. (2017) Note on single machine scheduling problems with resource dependent release times. Note on single machine scheduling problems with resource dependent release times.
Vahid Kayvanfar, M. Zandieh & Ehsan Teymourian. (2015) An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach. Computational and Applied Mathematics 36:1, pages 159-184.
Crossref
Chao Lu, Xinyu Li, Liang Gao, Wei Liao & Jin Yi. (2017) An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times. Computers & Industrial Engineering 104, pages 156-174.
Crossref
Hans Kellerer & Vitaly A. Strusevich. (2015) Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications. Annals of Operations Research 240:1, pages 39-94.
Crossref
Ilkyeong Moon, Sanghyup Lee, Moonsoo Shin & Kwangyeol Ryu. (2014) Evolutionary resource assignment for workload-based production scheduling. Journal of Intelligent Manufacturing 27:2, pages 375-388.
Crossref
Daniel Oron. (2016) Scheduling controllable processing time jobs with position-dependent workloads. International Journal of Production Economics 173, pages 153-160.
Crossref
Chun-Lai Liu & Jian-Jun Wang. (2016) Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration. Asia-Pacific Journal of Operational Research 33:01, pages 1650001.
Crossref
Xinle Liang, Huaping Chen & Jose A. Lozano. (2015) A Boltzmann-Based Estimation of Distribution Algorithm for a General Resource Scheduling Model. IEEE Transactions on Evolutionary Computation 19:6, pages 793-806.
Crossref
Dujuan Wang, Feng Liu, Yunqiang Yin, Jianjun Wang & Yanzhang Wang. (2015) Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period. Journal of Combinatorial Optimization 30:4, pages 967-981.
Crossref
Hui Zhu, Min Li & Zhangjin Zhou. (2015) Machine scheduling with deteriorating and resource-dependent maintenance activity. Computers & Industrial Engineering 88, pages 479-486.
Crossref
Davide Giglio. (2015) Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times. Journal of Scheduling 18:5, pages 525-543.
Crossref
S.S. Panwalkar & Christos Koulamas. (2015) On equivalence between the proportionate flow shop and single-machine scheduling problems. Naval Research Logistics (NRL) 62:7, pages 595-603.
Crossref
Shenglong Jiang, Min Liu, Jinghua Hao & Wangping Qian. (2015) A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry. Computers & Industrial Engineering 87, pages 518-531.
Crossref
Hadi Mokhtari. (2014) Designing an efficient bi-criteria iterated greedy heuristic for simultaneous order scheduling and resource allocation: a balance between cost and lateness measures. Neural Computing and Applications 26:5, pages 1085-1101.
Crossref
Esra Koca, Hande Yaman & M. Selim Aktürk. (2015) Stochastic lot sizing problem with controllable processing times. Omega 53, pages 1-10.
Crossref
Ping-Hung Hsieh, Suh-Jenq Yang & Dar-Li Yang. (2015) Decision support for unrelated parallel machine scheduling with discrete controllable processing times. Applied Soft Computing 30, pages 475-483.
Crossref
M. H. Fazel Zarandi & Vahid Kayvanfar. (2014) A bi-objective identical parallel machine scheduling problem with controllable processing times: a just-in-time approach. The International Journal of Advanced Manufacturing Technology 77:1-4, pages 545-563.
Crossref
Dvir Shabtay, George Steiner & Liron Yedidsion. (2015) A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. Discrete Applied Mathematics 182, pages 115-121.
Crossref
Chengxin Luo. (2015) Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times. Numerical Algebra, Control & Optimization 5:1, pages 71-77.
Crossref
Yuelei Liu & Zuren Feng. (2014) Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Computers & Industrial Engineering 75, pages 170-175.
Crossref
Shu Xia Zhang & Yu Zhong Zhang. (2014) Scheduling with Discretely Compressible Processing Times to Minimize Makespan. Applied Mechanics and Materials 575, pages 926-930.
Crossref
Chou-Jung Hsu & Dar-Li Yang. (2012) Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time. Optimization Letters 8:2, pages 519-531.
Crossref
Der-Chiang Li, Peng-Hsiang Hsu & Chih-Chieh Chang. (2014) A Genetic Algorithm-Based Approach for Single-Machine Scheduling with Learning Effect and Release Time. Mathematical Problems in Engineering 2014, pages 1-12.
Crossref
Baruch Mor & Gur Mosheiov. (2014) Batch scheduling of identical jobs with controllable processing times. Computers & Operations Research 41, pages 115-124.
Crossref
Alessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur SoukhalAlessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur Soukhal. 2014. Multiagent Scheduling. Multiagent Scheduling 217 260 .
Alessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur SoukhalAlessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur Soukhal. 2014. Multiagent Scheduling. Multiagent Scheduling 189 215 .
Alessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur SoukhalAlessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur Soukhal. 2014. Multiagent Scheduling. Multiagent Scheduling 147 187 .
Alessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur SoukhalAlessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur Soukhal. 2014. Multiagent Scheduling. Multiagent Scheduling 57 145 .
Alessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur SoukhalAlessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur Soukhal. 2014. Multiagent Scheduling. Multiagent Scheduling 23 55 .
Alessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur SoukhalAlessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli & Ameur Soukhal. 2014. Multiagent Scheduling. Multiagent Scheduling 1 22 .
Min Ji, Jiaojiao Ge, Ke Chen & T.C.E. Cheng. (2013) Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity. Computers & Industrial Engineering 66:4, pages 952-961.
Crossref
Vahid Kayvanfar, Iraj Mahdavi & GH. M. Komaki. (2013) A drastic hybrid heuristic algorithm to approach to JIT policy considering controllable processing times. The International Journal of Advanced Manufacturing Technology 69:1-4, pages 257-267.
Crossref
Shu Xia Zhang & Yu Zhong Zhang. (2013) Single Machine Scheduling with Discretely Compressible Processing Times. Advanced Materials Research 787, pages 1020-1024.
Crossref
Yunqiang Yin, T.C.E. Cheng, Shuenn-Ren Cheng & Chin-Chia Wu. (2013) Single-machine batch delivery scheduling with an assignable common due date and controllable processing times. Computers & Industrial Engineering 65:4, pages 652-662.
Crossref
Hans Kellerer & Vitaly Strusevich. (2013) Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. European Journal of Operational Research 228:1, pages 24-32.
Crossref
Chia Lun Hsu & Jin Shiuh Taur. (2013) Unrelated Parallel-Machine Scheduling with Controllable Processing Time. Applied Mechanics and Materials 321-324, pages 1993-1998.
Crossref
Vahid Kayvanfar, Iraj Mahdavi & GH.M. Komaki. (2013) Single machine scheduling with controllable processing times to minimize total tardiness and earliness. Computers & Industrial Engineering 65:1, pages 166-175.
Crossref
Zeynep Uruk, Hakan Gultekin & M. Selim Akturk. (2013) Two-machine flowshop scheduling with flexible operations and controllable processing times. Computers & Operations Research 40:2, pages 639-653.
Crossref
Liron Yedidsion. (2012) Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine. Journal of Scheduling.
Crossref
Valery Gordon, Vitaly Strusevich & Alexandre Dolgui. (2011) Scheduling with due date assignment under special conditions on job processing. Journal of Scheduling 15:4, pages 447-456.
Crossref
Hans Kellerer & Vitaly A. Strusevich. (2011) The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR 10:2, pages 111-161.
Crossref
Dvir Shabtay, Yaron Bensoussan & Moshe Kaspi. (2012) A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system. International Journal of Production Economics 136:1, pages 67-74.
Crossref
Dvir Shabtay & George Steiner. 2012. Just-in-Time Systems. Just-in-Time Systems 3 20 .
Kai Li, Ye Shi, Shan-lin Yang & Ba-yi Cheng. (2011) Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Applied Soft Computing 11:8, pages 5551-5557.
Crossref
Daniel Oron. (2011) Scheduling a batching machine with convex resource consumption functions. Information Processing Letters 111:19, pages 962-967.
Crossref
Dvir Shabtay & George Steiner. (2010) A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. Journal of Scheduling 14:5, pages 455-469.
Crossref
Ling-Huey Su, Wei-Yi Chang & Fuh-Der Chou. (2011) Minimizing maximum lateness on identical parallel machines with flexible resources and machine eligibility constraints. The International Journal of Advanced Manufacturing Technology 56:9-12, pages 1195-1204.
Crossref
Liron Yedidsion, Dvir Shabtay & Moshe Kaspi. (2011) Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling. Discrete Applied Mathematics 159:12, pages 1264-1278.
Crossref
Yaron Leyvand, Dvir Shabtay & George Steiner. (2010) A unified approach for scheduling with convex resource consumption functions using positional penalties. European Journal of Operational Research 206:2, pages 301-312.
Crossref
Dan Wang, Ming-Zheng Wang & Ji-Bo Wang. (2010) Single-machine scheduling with learning effect and resource-dependent processing times. Computers & Industrial Engineering 59:3, pages 458-462.
Crossref
Guohua Wan, Sudheer R. Vakati, Joseph Y.-T. Leung & Michael Pinedo. (2010) Scheduling two agents with controllable processing times. European Journal of Operational Research 205:3, pages 528-539.
Crossref
Christos Koulamas, Sushil Gupta & George J. Kyparisis. (2010) A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times. European Journal of Operational Research 205:2, pages 479-482.
Crossref
Iraj Mahdavi, Vahid Kayvanfar & G. M. Komaki. (2010) Minimizing total tardiness and earliness problem with controllable processing times using an effective heuristic. Minimizing total tardiness and earliness problem with controllable processing times using an effective heuristic.
M. Zouba, P. Baptiste & D. Rebaine. (2009) Scheduling identical parallel machines and operators within a period based changing mode. Computers & Operations Research 36:12, pages 3231-3239.
Crossref
Liron Yedidsion, Dvir Shabtay, Ephraim Korach & Moshe Kaspi. (2009) A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine. International Journal of Production Economics 119:2, pages 298-307.
Crossref
Chao-Tang Tseng, Ching-Jong Liao & Kuo-Ling Huang. (2009) Minimizing total tardiness on a single machine with controllable processing times. Computers & Operations Research 36:6, pages 1852-1858.
Crossref
M. Seli̇m Aktürk, Alper Atamtürk & Si̇nan Gürel. (2009) A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Operations Research Letters 37:3, pages 187-191.
Crossref
NATALIA V. SHAKHLEVICHAKIYOSHI SHIOURA & VITALY A. STRUSEVICH. (2012) SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION. International Journal of Foundations of Computer Science 20:02, pages 247-269.
Crossref
Dvir Shabtay & George Steiner. (2007) The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Annals of Operations Research 159:1, pages 25-40.
Crossref
Sinan Gurel & M. Selim Akturk. (2007) Optimal allocation and processing time decisions on non-identical parallel CNC machines: ϵ-constraint approach. European Journal of Operational Research 183:2, pages 591-607.
Crossref
Liron Yedidsion, Dvir Shabtay & Moshe Kaspi. (2007) A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. Journal of Scheduling 10:6, pages 341-352.
Crossref
Dvir Shabtay & George Steiner. (2007) Single machine batch scheduling to minimize total completion time and resource consumption costs. Journal of Scheduling 10:4-5, pages 255-261.
Crossref
Dvir Shabtay & George Steiner. (2007) A survey of scheduling with controllable processing times. Discrete Applied Mathematics 155:13, pages 1643-1666.
Crossref
Sinan Gurel & M. Selim Akturk. (2007) Considering manufacturing cost and scheduling performance on a CNC turning machine. European Journal of Operational Research 177:1, pages 325-343.
Crossref
Ji-Bo Wang & Zun-Quan Xia. (2007) Single machine scheduling problems with controllable processing times and total absolute differences penalties. European Journal of Operational Research 177:1, pages 638-645.
Crossref
Guohua Wan. 2007. Combinatorial Optimization and Applications. Combinatorial Optimization and Applications 279 290 .
Moshe Kaspi & Dvir Shabtay. (2006) A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Computers & Operations Research 33:10, pages 3015-3033.
Crossref
Dvir Shabtay & Moshe Kaspi. (2006) Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research 173:1, pages 92-107.
Crossref
Bas van Velzen. (2006) Sequencing games with controllable processing times. European Journal of Operational Research 172:1, pages 64-85.
Crossref
Ji-Bo Wang. (2006) Single machine common flow allowance scheduling with controllable processing times. Journal of Applied Mathematics and Computing 21:1-2, pages 249-257.
Crossref
Dvir Shabtay & Moshe Kaspi. (2006) Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function. Naval Research Logistics (NRL) 53:3, pages 204-216.
Crossref
Ji-Bo Wang. (2006) Single machine scheduling with common due date and controllable processing times. Applied Mathematics and Computation 174:2, pages 1245-1254.
Crossref
Zhigang Cao, Zhen Wang, Yuzhong Zhang & Shoupeng Liu. 2006. Theory and Applications of Models of Computation. Theory and Applications of Models of Computation 90 98 .
Han Hoogeveen. (2005) Multicriteria scheduling. European Journal of Operational Research 167:3, pages 592-623.
Crossref
Klaus Jansen, Monaldo Mastrolilli & Roberto Solis-Oba. (2005) Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research 167:2, pages 297-319.
Crossref
Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak & Frank Werner. (2005) Positive half-products and scheduling with controllable processing times. European Journal of Operational Research 165:2, pages 416-422.
Crossref
Xiuli Wang & T.C.E. Cheng. (2005) Single machine scheduling with resource dependent release times and processing times. European Journal of Operational Research 162:3, pages 727-739.
Crossref
C. T. Ng, T. C. Edwin Cheng, Adam Janiak & Mikhail Y. Kovalyov. (2005) Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. Annals of Operations Research 133:1-4, pages 163-174.
Crossref
Dvir Shabtay & Moshe Kaspi. (2004) Minimizing the total weighted flow time in a single machine with controllable processing times. Computers & Operations Research 31:13, pages 2279-2289.
Crossref
Klaus Jansen & Monaldo Mastrolilli. (2004) Approximation schemes for parallel machine scheduling problems with controllable processing times. Computers & Operations Research 31:10, pages 1565-1581.
Crossref
Richard L. DanielsJoseph B. MazzolaDailun Shi. (2004) Flow Shop Scheduling with Partial Resource Flexibility. Management Science 50:5, pages 658-669.
Crossref
C.T. Daniel Ng, T.C.Edwin Cheng & Mikhail Y. Kovalyov. (2004) Single machine batch scheduling with jointly compressible setup and processing times. European Journal of Operational Research 153:1, pages 211-219.
Crossref
C.T.Daniel Ng, T.C.Edwin Cheng, Mikhail Y. Kovalyov & S.S. Lam. (2003) Single machine scheduling with a variable common due date and resource-dependent processing times. Computers & Operations Research 30:8, pages 1173-1185.
Crossref
T.C.E. Cheng & Mikhail Y. Kovalyov. (2002) An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. Computers & Operations Research 29:14, pages 2087-2091.
Crossref
Guohua Wan, Benjamin P.-C. Yen & Chung-Lun Li. (2001) Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. Information Processing Letters 79:6, pages 273-280.
Crossref
Dirk Biskup & Hermann Jahnke. (2001) Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics 69:3, pages 317-322.
Crossref
Antonio Restivo, Simona Ronchi Della Rocca & Luca RoversiKlaus Jansen, Monaldo Mastrolilli & Roberto Solis-Oba. 2001. Theoretical Computer Science. Theoretical Computer Science 107 122 .
T. C. Edwin Cheng & Natalia Shakhlevich. (1999) Proportionate flow shop with controllable processing times. Journal of Scheduling 2:6, pages 253-265.
Crossref
G.I. Adamopoulos, C.P. Pappis & N.I. Karacapilidis. (2006) Job sequencing with uncertain and controllable processing times. International Transactions in Operational Research 6:5, pages 483-493.
Crossref
Dirk Biskup. (1999) Single-machine scheduling with learning considerations. European Journal of Operational Research 115:1, pages 173-178.
Crossref
F. Kolahan & M. Liang. (1998) An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups. European Journal of Operational Research 109:1, pages 142-159.
Crossref
T. C. Edwin Cheng, Adam Janiak & Mikhail Y. Kovalyov. (1998) Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. SIAM Journal on Optimization 8:2, pages 617-630.
Crossref
Bo Chen, Chris N. Potts & Gerhard J. Woeginger. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization 1493 1641 .
Zhi-Long Chen, Qing Lu & Guochun Tang. (1997) Single machine scheduling with discretely controllable processing times. Operations Research Letters 21:2, pages 69-76.
Crossref
Bahram Alidaee & Gary A. Kochenberger. (2009) A FRAMEWORK FOR MACHINE SCHEDULING PROBLEMS WITH CONTROLLABLE PROCESSING TIMES. Production and Operations Management 5:4, pages 391-405.
Crossref
Adam Janiak & Mikhail Y. Kovalyov. (1996) Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operational Research 94:2, pages 284-291.
Crossref
George I. Adamopoulos & Costas P. Pappis. (1996) A fuzzy-linguistic approach to a multi-criteria sequencing problem. European Journal of Operational Research 92:3, pages 628-636.
Crossref
T.C.E. Cheng, C. Oğuz & X.D. Qi. (1996) Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics 43:2-3, pages 107-113.
Crossref
T.C.E. Cheng, C. Oǧuz & X.D. Qi. (1996) Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics 43:1, pages 29-35.
Crossref
R.N. Tomastik, P.B. Luh & Guandong Liu. (1996) Scheduling flexible manufacturing systems for apparel production. IEEE Transactions on Robotics and Automation 12:5, pages 789-799.
Crossref
Eugeniusz Nowicki & Stanisław Zdrzałka. (1995) A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times. Discrete Applied Mathematics 63:3, pages 237-256.
Crossref
P.S. Sundararaghavan & A.S. Kunnathur. (1994) Single machine scheduling with start time dependent processing times: Some solvable cases. European Journal of Operational Research 78:3, pages 394-403.
Crossref
Eugeniusz Nowicki. (1993) An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times. European Journal of Operational Research 70:3, pages 342-349.
Crossref
Bahram Alidaee & Ahmad Ahmadian. (1993) Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research 70:3, pages 335-341.
Crossref
Richard L. Daniels & Joseph B. Mazzola. (1993) A tabu-search heuristic for the flexible-resource flow shop scheduling problem. Annals of Operations Research 41:3, pages 207-230.
Crossref
S.S. Panwalkar & R. Rajagopalan. (1992) Single-machine sequencing with controllable processing times. European Journal of Operational Research 59:2, pages 298-302.
Crossref
Stanisław Zdrzałka. (1991) Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis. Operations Research Letters 10:9, pages 519-523.
Crossref
In-Soo Lee. (1991) Single machine scheduling with controllable processing times: a parametric study. International Journal of Production Economics 22:2, pages 105-110.
Crossref
Richard L. Daniels. (1990) A multi-objective approach to resource allocation in single machine scheduling. European Journal of Operational Research 48:2, pages 226-241.
Crossref
Eugeniusz Nowicki & Stanisław Zdrzałka. (1990) A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics 26:2-3, pages 271-287.
Crossref
R.L. DANIELS. 1989. Advances in Project Scheduling. Advances in Project Scheduling 87 112 .
TD Fry, RD Armstrong & H Lewis. (1989) A framework for single machine multiple objective sequencing research. Omega 17:6, pages 595-607.
Crossref
Eugeniusz Nowicki & Stanisław Zdrzałka. (1988) A two-machine flow shop scheduling problem with controllable job processing times. European Journal of Operational Research 34:2, pages 208-220.
Crossref
Sushil K Gupta & Jerzy Kyparisis. (1987) Single machine scheduling research. Omega 15:3, pages 207-227.
Crossref
Tapan Sen & Sushil K Gupta. (1984) A state-of-art survey of static scheduling research involving due dates. Omega 12:1, pages 63-76.
Crossref
Luk N. Van Wassenhove & Kenneth R. Baker. (1982) A bicriterion approach to time/cost trade-offs in sequencing. European Journal of Operational Research 11:1, pages 48-54.
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.