Note on “A note on single-machine group scheduling problems with position-based learning effect”

Similar items

• Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects

  Scholarly record2016SpringerPlusLei Yue, Zailin Guan, Ullah Saif, Fei Zhang

  Group scheduling is significant for efficient and cost effective production system. However, there exist setup times between the groups, which require to decrease it by sequencing groups in an efficient way. Current research is focused on a sequence dependent group scheduling pro

• A note on single-machine group scheduling problems with position-based learning effect

  Open-access article2009Applied Mathematical ModellingWen-ChiungLee, Chin-ChiaWu

• Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times

  Scholarly record2014Yong He, Li Sun, Gradimir Milovanovic

  We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing or decreasing functions of their starting times. Jobs in each group have the same dete

• Single-machine group scheduling problems with deterioration consideration

  Scholarly record2008Computers & ORChin-Chia Wu, Yau-Ren Shiau, Wen-Chiung Lee

  In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job deterioration is relatively unexplored in the context of group technology. In this paper, we conside

• An Approach to Solve Single Machine Job Scheduling Problem using Heuristic Algorithm

  Scholarly record2015Satyasundara Mahapatra, Ranjan Dash, Sateesh Kumar Pradhan

  1 Department of Computer Science, IISIT, Bhubaneswar, INDIA 2 Department of Mechanical Engineering, CET, Bhubaneswar, INDIA 3 Department of Computer Science, Utkal University, Bhubaneswar, INDIA _____________________________________________________________________________________

• Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

  Scholarly record2006Computers & ORRasaratnam Logendran, Nasser Salmasi, Chelliah Sriskandarajah

  This paper focuses on minimizing the total completion time in two-machine group scheduling problems with sequence-dependent setups that are typically found in discrete parts manufacturing. As the problem is characterized as strongly NP-hard, three search algorithms based on tabu