☆ 4.7 Article

Resource Allocation Scheduling with Position-Dependent Weights and Generalized Earliness-Tardiness Cost

MATHEMATICS (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Engineering, Multidisciplinary

RESEARCH ON POSITION-DEPENDENT WEIGHTS SCHEDULING WITH DELIVERY TIMES AND TRUNCATED SUM-OF-PROCESSING-TIMES-BASED LEARNING EFFECT

Si-Han Wang et al.

Summary: This paper addresses the single-machine position-dependent weights scheduling problem with past-sequence-dependent delivery times and truncated sum-of-processing-times-based learning effect. The objective is to minimize the weighted sum of due date, early jobs, and tardy jobs, where the weights are dependent on the position. The optimal properties and corresponding algorithms for obtaining the optimal sequence and due dates are provided under different types of due date assignments.

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION (2023)

添加到收藏夹

Article Operations Research & Management Science

Improved algorithms for proportionate flow shop scheduling with due-window assignment

Jin Qian et al.

Summary: This study investigates due-window proportionate flow shop scheduling problems with position-dependent weights and proposes a faster solution for the CONW problem.

ANNALS OF OPERATIONS RESEARCH (2022)

添加到收藏夹

Article Management

Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work

Dvir Shabtay et al.

Summary: Traditional scheduling models assume predefined due dates, but recent models focus on coordinating due date assignment and job scheduling. We analyze a single machine scheduling problem where a common due date is assigned to minimize an objective function. We provide solvability results and algorithms for different scenarios.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

添加到收藏夹

Article Mathematics, Applied

Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times

Wanlei Wang

Summary: This paper investigates the single-machine due-date assignment problem with past-sequence-dependent setup times, proposing optimal solutions under different due-date assignment scenarios. The problem is proven to be solvable in polynomial time by minimizing a linear weighted sum. Furthermore, three extensions are provided by considering various dependencies in processing times.

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING (2022)

添加到收藏夹

Article Operations Research & Management Science

Due-Window Assignment Methods and Scheduling with Generalized Positional-Dependent Weights

Ji-Bo Wang et al.

Summary: This article focuses on a single-machine scheduling problem, using common and slack due-window assignment methods. Both the job sequence and due-windows are decision variables. A performance criterion is considered that takes into account multiple factors. By establishing certain properties, it is shown that the problem can be solved in O(n(5)) time, where n is the number of jobs. The model is extended to cases of general position-dependent processing times and time-dependent processing times.

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH (2022)

添加到收藏夹

Article Operations Research & Management Science

Seru Scheduling Problems with Multiple Due-Windows Assignment and Learning Effect

Yujing Jiang et al.

Summary: This paper investigates the impact of multiple due window assignment and learning effect on seru scheduling problems. The study discusses the effects of due-window allocation strategy and learning effect on total cost through numerical examples and special cases.

JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING (2022)

添加到收藏夹

Article Mathematics

Scheduling with Resource Allocation, Deteriorating Effect and Group Technology to Minimize Total Completion Time

Jia-Xuan Yan et al.

Summary: This paper studies a single-machine problem with resource allocation and deteriorating effect, aiming to minimize the total completion time through determining the schedules of groups and jobs under group technology and limited resources. Polynomial time algorithms are given for special cases, while for the general case, heuristic, tabu search, and exact algorithms are proposed.

MATHEMATICS (2022)

添加到收藏夹

Article Mathematical & Computational Biology

Due-window assignment scheduling with past-sequence-dependent setup times

Weiguo Liu et al.

Summary: This article investigates the problem of due-window assignment scheduling with setup times on a single machine and proposes a polynomial time algorithm to optimally solve this problem. An extension to the problem with learning and deterioration effects is also studied.

MATHEMATICAL BIOSCIENCES AND ENGINEERING (2022)

添加到收藏夹

Article Engineering, Multidisciplinary

A note on due-date assignment scheduling with job-dependent learning effects and convex resource allocation

Yuan-Yuan Lu et al.

Summary: This note revisits single machine due-date assignment scheduling and shows that the problem can be solved in polynomial time under certain conditions, correcting previous published results.

ENGINEERING OPTIMIZATION (2021)

添加到收藏夹

Article Management

Due-window assignment scheduling problem with stochastic processing times

Qing Yue et al.

Summary: This paper studies two due-window assignment scheduling problems with different distributional information, one with normal distribution processing times and the other with only mean and variance information. Optimal solutions are found through analysis and branch-and-bound algorithms developed.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times

Ji-Bo Wang et al.

Summary: This article studies scheduling problems with past-sequence-dependent delivery times on a single-machine and proves that certain objective cost minimization can be solved in O(n log n) time. The model can also be extended to position-dependent processing times.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2021)

添加到收藏夹

Article Mathematics

The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect

Jin Qian et al.

Summary: This paper discusses a single-machine scheduling problem with past-sequence-dependent delivery times and a learning effect based on the sum of processing times. It aims to minimize total costs including early and tardy jobs, with the due date being variable. The paper demonstrates that under different due date scenarios, these problems are polynomial time solvable, and presents three polynomial time algorithms for obtaining the optimal sequence.

MATHEMATICS (2021)

添加到收藏夹

Article Engineering, Multidisciplinary

RESOURCE ALLOCATION FLOWSHOP SCHEDULING WITH LEARNING EFFECT AND SLACK DUE WINDOW ASSIGNMENT

Shuang Zhao

Summary: The study combines learning effect and controllable processing times in a two-machine no-wait setup for flowshop scheduling problems. The goal is to determine job sequence, slack due window, due window size, and resource allocation. A bicriteria analysis is provided for scheduling and resource consumption costs, which can be solved in polynomial time using three different combinations.

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION (2021)

添加到收藏夹

Article Management

Bicriterion scheduling with truncated learning effects and convex controllable processing times

Ji-Bo Wang et al.

Summary: This paper investigates single-machine scheduling considering job processing time functions based on its position, truncation parameter, and resource allocation. A bicriteria analysis is provided for convex resource consumption functions, with positional-dependent weights being solvable in polynomial time, while job-dependent weights pose an open question. Heuristics and algorithms are proposed for solving problems with job-dependent weights.

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2021)

添加到收藏夹

Article Engineering, Multidisciplinary

Due-window assignment scheduling problems with position-dependent weights on a single machine

Ji-Bo Wang et al.

ENGINEERING OPTIMIZATION (2020)

添加到收藏夹

Article Operations Research & Management Science

Due-window assignment scheduling in the proportionate flow shop setting

Xinyu Sun et al.

ANNALS OF OPERATIONS RESEARCH (2020)

添加到收藏夹

Review Computer Science, Interdisciplinary Applications

Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review

Gustavo Alencar Rolim et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2020)

添加到收藏夹

Article Engineering, Multidisciplinary

Single machine scheduling with slack due dates assignment

Weiguo Liu et al.

ENGINEERING OPTIMIZATION (2017)

添加到收藏夹

Article Engineering, Industrial

Single machine due window assignment and resource allocation scheduling problems with learning and general positional effects

Lu Liu et al.

JOURNAL OF MANUFACTURING SYSTEMS (2017)

添加到收藏夹

Article Operations Research & Management Science

Common Due-Window Assignment and Group Scheduling with Position-Dependent Processing Times

Shang-Chia Liu

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH (2015)

添加到收藏夹

Review Management

A survey on scheduling problems with due windows

Adam Janiak et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)

添加到收藏夹

Article Management

Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time

Y. Yin et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2014)

添加到收藏夹

Review Mathematics, Applied

A survey of scheduling with controllable processing times

Dvir Shabtay et al.

DISCRETE APPLIED MATHEMATICS (2007)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.