- Home
- Publications
- Publication Search
- Publication Details
Title
Single machine interfering jobs problem with flowtime objective
Authors
Keywords
Scheduling, Interfering jobs, Two-agent scheduling problem, Total flowtime, Single machine
Journal
JOURNAL OF INTELLIGENT MANUFACTURING
Volume 29, Issue 5, Pages 953-972
Publisher
Springer Nature
Online
2015-08-20
DOI
10.1007/s10845-015-1141-6
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Single machine scheduling with interfering job sets
- (2013) Ketan Khowala et al. COMPUTERS & OPERATIONS RESEARCH
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems
- (2013) Paz Perez-Gonzalez et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- (2013) J. J. Yuan et al. JOURNAL OF SCHEDULING
- A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers
- (2012) José A. Ventura et al. JOURNAL OF INTELLIGENT MANUFACTURING
- Solving a two-agent single-machine scheduling problem considering learning effect
- (2011) Der-Chiang Li et al. COMPUTERS & OPERATIONS RESEARCH
- Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations
- (2011) Wen-Hsiang Wu et al. JOURNAL OF INTELLIGENT MANUFACTURING
- Setting a common due date in a constrained flowshop: A variable neighbourhood search approach
- (2010) Paz Perez-Gonzalez et al. COMPUTERS & OPERATIONS RESEARCH
- Scheduling two agents with controllable processing times
- (2010) Guohua Wan et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Two robust meta-heuristics for scheduling multiple job classes on a single machine with multiple criteria
- (2010) R. Soltani et al. EXPERT SYSTEMS WITH APPLICATIONS
- A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem
- (2010) Lin-Yu Tseng et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- (2009) Paz Perez-Gonzalez et al. COMPUTERS & OPERATIONS RESEARCH
- Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms
- (2009) Purushothaman Damodaran et al. European Journal of Industrial Engineering
- Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups
- (2009) Wojciech Bożejko JOURNAL OF INTELLIGENT MANUFACTURING
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- (2009) Alessandro Agnetis et al. JOURNAL OF SCHEDULING
- Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm
- (2009) Hao Luo et al. ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
- Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications
- (2008) Hans Kellerer et al. ALGORITHMICA
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
- (2008) Rubén Ruiz et al. COMPUTERS & OPERATIONS RESEARCH
- Scheduling interfering job sets on parallel machines
- (2008) Hari Balasubramanian et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A fitness-based weighting mechanism for multicriteria flowshop scheduling using genetic algorithms
- (2008) Jose M. Framinan INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Heuristics for minimizing total completion time and maximum lateness on identical parallel machines with setup times
- (2008) M. T. Yazdani Sabouni et al. JOURNAL OF INTELLIGENT MANUFACTURING
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started