- Home
- Publications
- Publication Search
- Publication Details
Title
Late and early work scheduling: A survey
Authors
Keywords
Scheduling, Late work, Early work, Due date related criteria
Journal
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
Volume -, Issue -, Pages 102453
Publisher
Elsevier BV
Online
2021-03-25
DOI
10.1016/j.omega.2021.102453
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A note on scheduling a rate modifying activity to minimize total late work
- (2021) Gur Mosheiov et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Minimizing total late work on a single machine with generalized due-dates
- (2021) Gur Mosheiov et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- (2021) Ruyan He et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work
- (2021) Byung-Cheon Choi et al. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
- Integer Programming Formulations in Sequencing with Total Earliness and Tardiness Penalties, Arbitrary Due Dates, and No Idle Time: A Concise Review and Extension
- (2021) Bahram Alidaee et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Mirror scheduling problems with early work and late work criteria
- (2020) Xin Chen et al. JOURNAL OF SCHEDULING
- Single-machine scheduling with multi-agents to minimize total weighted late work
- (2020) Shi-Sheng Li et al. JOURNAL OF SCHEDULING
- Exact and heuristic algorithms for scheduling on two identical machines with early work maximization
- (2020) Xin Chen et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- (2020) Xin Chen et al. DISCRETE APPLIED MATHEMATICS
- Two-agent scheduling problems under rejection budget constraints
- (2020) Daniel Oron OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs
- (2020) Ren-Xia Chen et al. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
- A common approximation framework for early work, late work, and resource leveling problems
- (2020) Péter Györgyi et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
- (2020) Ruyan He et al. Mathematics
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- (2020) Yuan Zhang et al. NAVAL RESEARCH LOGISTICS
- A note on scheduling on two identical machines with early work maximization
- (2020) Yiwei Jiang et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Single‐machine scheduling with deadlines to minimize the total weighted late work
- (2019) Rubing Chen et al. NAVAL RESEARCH LOGISTICS
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- (2019) Xin Chen et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches
- (2018) Akiyoshi Shioura et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Reduction of carbon emission and total late work criterion in job shop scheduling by applying a multi-objective imperialist competitive algorithm
- (2018) Hamed Piroozfard et al. International Journal of Computational Intelligence Systems
- Scheduling on a proportionate flowshop to minimise total late work
- (2018) Enrique Gerstl et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Two machine scheduling subject to arbitrary machine availability constraint
- (2018) Yumei Huo et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Flow shop learning effect scheduling problem with release dates
- (2018) Danyu Bai et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Parallel-machine rescheduling with job unavailability and rejection
- (2018) Dujuan Wang et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- The Non-Permutation Flow-Shop scheduling problem: A literature review
- (2018) Daniel Alejandro Rossit et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm
- (2018) Hamed Piroozfard et al. RESOURCES CONSERVATION AND RECYCLING
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion
- (2018) Shang-Chia Liu et al. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
- A note on a two-agent scheduling problem related to the total weighted late work
- (2018) Yuan Zhang et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Scheduling two agents on a single machine: A parameterized analysis of NP-hard problems
- (2018) Danny Hermelin et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Two-machine flow-shop scheduling to minimize total late work: revisited
- (2018) Xin Chen et al. ENGINEERING OPTIMIZATION
- Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
- (2018) Jacek Błażewicz et al. ENGINEERING OPTIMIZATION
- A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date
- (2018) Hans Kellerer et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work
- (2017) Malgorzata Sterna et al. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
- On single-machine scheduling with workload-dependent maintenance duration
- (2017) Wenchang Luo et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- A single machine scheduling problem to minimize total early work
- (2016) Yoav Ben-Yehoshua et al. COMPUTERS & OPERATIONS RESEARCH
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- (2016) Zhang Xingong et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- (2016) Yunqiang Yin et al. NAVAL RESEARCH LOGISTICS
- Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints
- (2015) Mojtaba Afzalirad et al. ENGINEERING OPTIMIZATION
- Notes on inverse bin-packing problems
- (2015) Yerim Chung et al. INFORMATION PROCESSING LETTERS
- Scheduling on parallel identical machines with late work criterion: Offline and online cases
- (2015) Xin Chen et al. JOURNAL OF SCHEDULING
- Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem
- (2015) Chin-Chia Wu et al. SOFT COMPUTING
- A two-agent single-machine scheduling problem with late work criteria
- (2015) Du-Juan Wang et al. SOFT COMPUTING
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- (2014) Foroogh Abasian et al. APPLIED MATHEMATICAL MODELLING
- Minimizing total weighted late work in the resource-constrained project scheduling problem
- (2013) Mohammad Ranjbar et al. APPLIED MATHEMATICAL MODELLING
- The complexity of two supply chain scheduling problems
- (2013) Jianfeng Ren et al. INFORMATION PROCESSING LETTERS
- A survey of scheduling problems with late work criteria
- (2010) Malgorzata Sterna OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- (2009) JIANFENG REN et al. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
- Late work minimization in flow shops by a genetic algorithm
- (2009) Erwin Pesch et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- (2006) Jacek Blazewicz et al. COMPUTERS & OPERATIONS RESEARCH
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now