☆ 4.6 Article

A new perspective on single-machine scheduling problems with late work related criteria

ANNALS OF OPERATIONS RESEARCH (2023)

Related references

Note: Only part of the references are listed.

Article Operations Research & Management Science

New algorithms for minimizing the weighted number of tardy jobs on a single machine

Danny Hermelin et al.

Summary: This paper studies the classical single machine scheduling problem aiming to minimize the weighted number of tardy jobs, analyzing the impact of different numbers of due dates, processing times, and weights on the complexity of the problem. The problem belongs to the class of fixed parameter tractable (FPT) problems when combining any two parameters, and it is solvable in polynomial time when either of the latter two parameters is constant.

ANNALS OF OPERATIONS RESEARCH (2021)

Add to Collection

Article Operations Research & Management Science

Single-machine serial-batch delivery scheduling with two competing agents and due date assignment

Yunqiang Yin et al.

Summary: This paper addresses single-machine batch delivery scheduling problems involving two competing agents and two due date assignment models. The objective is to minimize one agent's scheduling criterion while keeping the other agent's criterion value from exceeding a threshold. The problems considered in this study are shown to be NP-hard and have a fully polynomial-time approximation scheme.

ANNALS OF OPERATIONS RESEARCH (2021)

Add to Collection

Article Computer Science, Interdisciplinary Applications

A note on scheduling a rate modifying activity to minimize total late work

Gur Mosheiov et al.

Summary: This study investigates a single machine scheduling problem with a rate modifying activity, using total late work as the scheduling measure and introducing a pseudo-polynomial dynamic programming algorithm through numerical experiments. The results indicate that the algorithm efficiently solves large instances of the problem.

COMPUTERS & INDUSTRIAL ENGINEERING (2021)

Add to Collection

Article Management

Minimizing total late work on a single machine with generalized due-dates

Gur Mosheiov et al.

Summary: This study focuses on single machine scheduling problems with generalized due-dates, examining scenarios like job rejection and machine unavailability. The research proves the NP-hardness of these problems and proposes dynamic programming algorithms. It concludes that scheduling problems under certain conditions remain NP-hard.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

Add to Collection

Article Management

Late and early work scheduling: A survey

Malgorzata Sterna

Summary: This paper presents a survey of scheduling problems based on early and late work criteria, discussing complexity analysis and algorithm proposals for various models, as well as their applications in online scheduling and supply chain management. New interesting results obtained since the first survey in 2011 are collected and discussed.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2021)

Add to Collection

Article Engineering, Manufacturing

Single-machine scheduling with multi-agents to minimize total weighted late work

Shi-Sheng Li et al.

JOURNAL OF SCHEDULING (2020)

Add to Collection

Article Computer Science, Software Engineering

Parameterized Multi-Scenario Single-Machine Scheduling Problems

Danny Hermelin et al.

ALGORITHMICA (2020)

Add to Collection

Article Engineering, Industrial

Scheduling on a proportionate flowshop to minimise total late work

Enrique Gerstl et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2019)

Add to Collection

Article Computer Science, Interdisciplinary Applications

A note on a two-agent scheduling problem related to the total weighted late work

Yuan Zhang et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2019)

Add to Collection

Article Engineering, Manufacturing

On the parameterized tractability of the just-in-time flow-shop scheduling problem

Danny Hermelin et al.

JOURNAL OF SCHEDULING (2019)

Add to Collection

Article Engineering, Multidisciplinary

Two-machine flow-shop scheduling to minimize total late work: revisited

Xin Chen et al.

ENGINEERING OPTIMIZATION (2019)

Add to Collection

Editorial Material Engineering, Multidisciplinary

Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work

Jacek Blazewicz et al.

ENGINEERING OPTIMIZATION (2019)

Add to Collection

Article Operations Research & Management Science

BICRITERIA SCHEDULING FOR DUE DATE ASSIGNMENT WITH TOTAL WEIGHTED TARDINESS

Hao Lin et al.

RAIRO-OPERATIONS RESEARCH (2018)

Add to Collection

Article Engineering, Environmental

Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm

Hamed Piroozfard et al.

RESOURCES CONSERVATION AND RECYCLING (2018)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Parameterized complexity of machine scheduling: 15 open problems

Matthias Mnich et al.

COMPUTERS & OPERATIONS RESEARCH (2018)

Add to Collection

Article Computer Science, Artificial Intelligence

A two-agent single-machine scheduling problem with late work criteria

Du-Juan Wang et al.

SOFT COMPUTING (2017)

Add to Collection

Article Engineering, Multidisciplinary

Common due date assignment and cumulative deterioration scheduling on a single machine

Shi-Sheng Li et al.

ENGINEERING OPTIMIZATION (2017)

Add to Collection

Article Computer Science, Interdisciplinary Applications

A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance

Baruch Mor et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2017)

Add to Collection

Article Engineering, Industrial

Due date assignment and scheduling on a single machine with two competing agents

Du-Juan Wang et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2016)

Add to Collection

Article Engineering, Manufacturing

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Xin Chen et al.

JOURNAL OF SCHEDULING (2016)

Add to Collection

Article Computer Science, Artificial Intelligence

Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem

Chin-Chia Wu et al.

SOFT COMPUTING (2016)

Add to Collection

Article Computer Science, Artificial Intelligence

Minimizing sum of the due date assignment costs, maximum tardiness and distribution costs in a supply chain scheduling problem

Parisa Assarzadegan et al.

APPLIED SOFT COMPUTING (2016)

Add to Collection

Article Management

Optimal restricted due date assignment in scheduling

Dvir Shabtay

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

Add to Collection

Article Operations Research & Management Science

Approximation Schemes for Single-Machine Scheduling with a Fixed Maintenance Activity to Minimize the Total Amount of Late Work

Yunqiang Yin et al.

NAVAL RESEARCH LOGISTICS (2016)

Add to Collection

Article Engineering, Manufacturing

Interval scheduling and colorful independent sets

Rene van Bevern et al.

JOURNAL OF SCHEDULING (2015)

Add to Collection

Article Computer Science, Software Engineering

Scheduling and fixed-parameter tractability

Matthias Mnich et al.

MATHEMATICAL PROGRAMMING (2015)

Add to Collection

Article Computer Science, Information Systems

Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs

Adam Janiak et al.

INFORMATION SCIENCES (2013)

Add to Collection

Article Engineering, Manufacturing

A survey on offline scheduling with rejection

Dvir Shabtay et al.

JOURNAL OF SCHEDULING (2013)

Add to Collection

Article Operations Research & Management Science

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries

George Steiner et al.

ANNALS OF OPERATIONS RESEARCH (2011)

Add to Collection

Article Engineering, Manufacturing

A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

Dvir Shabtay et al.

JOURNAL OF SCHEDULING (2011)

Add to Collection

Review Management

A survey of scheduling problems with late work criteria

Malgorzata Sterna

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2011)

Add to Collection

Article Mathematics, Applied

Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Dvir Shabtay et al.

DISCRETE APPLIED MATHEMATICS (2010)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Due date assignments and scheduling a single machine with a general earliness/tardiness cost function

Dvir Shabtay

COMPUTERS & OPERATIONS RESEARCH (2008)

Add to Collection

Article Engineering, Manufacturing

Optimal due date assignment in multi-machine scheduling environments

Dvir Shabtay et al.

JOURNAL OF SCHEDULING (2008)

Add to Collection

Article Computer Science, Theory & Methods

Techniques for scheduling with rejection

DW Engels et al.

JOURNAL OF ALGORITHMS (2003)

Add to Collection

Article Management

Due-date assignment with asymmetric earliness-tardiness cost

G Mosheiov

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2003)

Add to Collection

© Peeref 2019-2024. All rights reserved.