Solving parallel machine problems with delivery times and tardiness objectives
Published 2019 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Solving parallel machine problems with delivery times and tardiness objectives
Authors
Keywords
-
Journal
ANNALS OF OPERATIONS RESEARCH
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2019-05-11
DOI
10.1007/s10479-019-03267-2
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs
- (2017) Manuel Mateo et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- (2016) Youjun Chen et al. THEORETICAL COMPUTER SCIENCE
- Cloud-based design and manufacturing: A new paradigm in digital manufacturing and design innovation
- (2015) Dazhong Wu et al. COMPUTER-AIDED DESIGN
- Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
- (2015) Fardin Ahmadizar et al. COMPUTERS & OPERATIONS RESEARCH
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- (2015) Jun Pei et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
- (2015) Youjun Chen et al. THEORETICAL COMPUTER SCIENCE
- Online scheduling on two parallel machines with release dates and delivery times
- (2014) Peihai Liu et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Scheduling parallel machines with single vehicle delivery
- (2014) Eray Cakici et al. JOURNAL OF HEURISTICS
- Ant colony optimization for unrelated parallel machine scheduling
- (2013) Chi-Wei Lin et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Cloud manufacturing: Strategic vision and state-of-the-art
- (2013) Dazhong Wu et al. JOURNAL OF MANUFACTURING SYSTEMS
- Iterated Local Search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- (2013) Hongyun Xu et al. JOURNAL OF SCHEDULING
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
- (2013) Jianming Dong et al. THEORETICAL COMPUTER SCIENCE
- Cloud manufacturing: a new manufacturing paradigm
- (2012) Lin Zhang et al. Enterprise Information Systems
- A hybrid approach based on the variable neighborhood search and particle swarm optimization for parallel machine scheduling problems—A case study for solar cell industry
- (2012) Yin-Yann Chen et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs
- (2012) Wenming Cheng et al. MATHEMATICAL PROBLEMS IN ENGINEERING
- New results on single-machine scheduling with past-sequence-dependent delivery times
- (2012) Ming Liu et al. THEORETICAL COMPUTER SCIENCE
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- (2011) Ji Tian et al. DISCRETE APPLIED MATHEMATICS
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- (2011) Ji Tian et al. INFORMATION PROCESSING LETTERS
- From cloud computing to cloud manufacturing
- (2011) Xun Xu ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
- Online batch scheduling on parallel machines with delivery times
- (2011) Yang Fang et al. THEORETICAL COMPUTER SCIENCE
- Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times
- (2010) Rene Driessel et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- (2010) Y.K. Lin et al. COMPUTERS & OPERATIONS RESEARCH
- Single-machine scheduling problems with past-sequence-dependent delivery times
- (2010) Christos Koulamas et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Optimal on-line algorithms for one batch machine with grouped processing times
- (2010) Yang Fang et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- An improved approximation algorithm for single machine scheduling with job delivery
- (2010) Peihai Liu et al. THEORETICAL COMPUTER SCIENCE
- Variable neighbourhood search: methods and applications
- (2009) Pierre Hansen et al. ANNALS OF OPERATIONS RESEARCH
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- (2008) LINGFA LU et al. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- (2008) M. Fatih Tasgetiren et al. COMPUTERS & OPERATIONS RESEARCH
- Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm
- (2008) J. Behnamian et al. EXPERT SYSTEMS WITH APPLICATIONS
- Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization
- (2008) N. R. Srinivasa Raghavan et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times
- (2008) Chun-Lung Chen et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Scheduling identical parallel machines to minimize total tardiness
- (2008) Dirk Biskup et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- (2008) Lingfa Lu et al. OPERATIONS RESEARCH LETTERS
- A best on-line algorithm for single machine scheduling with small delivery times
- (2007) Ji Tian et al. THEORETICAL COMPUTER SCIENCE
Become a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get StartedAsk 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