☆ 4.7 Article

Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation

MATHEMATICS (2023)

Related references

Note: Only part of the references are listed.

Article Engineering, Multidisciplinary

STUDY ON RESOURCE ALLOCATION SCHEDULING PROBLEM WITH LEARNING FACTORS AND GROUP TECHNOLOGY

Jia-Xuan Yan et al.

Summary: This paper investigates the problem of single-machine resource allocation scheduling with learning effects and group technology. The objective is to minimize total completion time by determining optimal job and group schedules, and resource allocations under limited availability. The problem is shown to be polynomially solvable for some special cases, and for the general case, heuristic, tabu search, and branch-and-bound algorithms are proposed. Numerical experiments are conducted to evaluate the performance of the heuristic and branch-and-bound algorithms.

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION (2023)

Add to Collection

Article Engineering, Chemical

Group Technology Scheduling with Due-Date Assignment and Controllable Processing Times

Weiguo Liu et al.

Summary: This paper investigates the common (slack) due-date assignment single-machine scheduling with controllable processing times within a group technology environment. The cost function minimizes scheduling (including the weighted sum of earliness, tardiness, and due-date assignment, where the weights are position-dependent) and resource-allocation costs under linear and convex resource allocation functions. If the size of jobs in each group is identical, the optimal group sequence can be obtained via an assignment problem. Furthermore, the problem is shown to be polynomially solvable in O(P-3) time, where P is the number of jobs.

PROCESSES (2023)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Due date assignment and two-agent scheduling under multitasking environment

Yongjian Yang et al.

Summary: This paper addresses a scheduling problem with due date assignment for two agents in a multitasking environment. The objective is to minimize the scheduling criterion related to the completion times of each agent's jobs, while considering interruptions and maintaining a given threshold for the total completion time. The problem is proven to be NP-hard and a dynamic programming algorithm is devised to solve it, showing that it has a fully polynomial-time approximation scheme.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2022)

Add to Collection

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)

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 Engineering, Multidisciplinary

Tabu Search Algorithm Based on Lower Bound and Exact Algorithm Solutions for Minimizing the Makespan in Non-Identical Parallel Machines Scheduling

Mohammed A. Noman et al.

Summary: The study introduces an improved algorithm based on tabu search algorithm to minimize the total completion time of jobs on nonidentical parallel machines by combining lower bound and exact algorithm solutions. The findings demonstrate the superiority and speed of the developed algorithm in providing the best solution compared to previous methods.

MATHEMATICAL PROBLEMS IN ENGINEERING (2021)

Add to Collection

Article Engineering, Multidisciplinary

Solution algorithms for single-machine group scheduling with ready times and deteriorating jobs

Feng Liu et al.

ENGINEERING OPTIMIZATION (2019)

Add to Collection

Article Engineering, Industrial

Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect

Xinyu Sun et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2019)

Add to Collection

Article Energy & Fuels

The impact of various carbon reduction policies on green flowshop scheduling

Mehdi Foumani et al.

APPLIED ENERGY (2019)

Add to Collection

Article Computer Science, Artificial Intelligence

Scheduling jobs with deterioration effect and controllable processing time

Lin Li et al.

NEURAL COMPUTING & APPLICATIONS (2018)

Add to Collection

Article Operations Research & Management Science

Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents

Yunqiang Yin et al.

NAVAL RESEARCH LOGISTICS (2018)

Add to Collection

Article Engineering, Industrial

A heuristic algorithm for master production scheduling problem with controllable processing times and scenario-based demands

Fateme Akhoondi et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2016)

Add to Collection

Article Operations Research & Management Science

CON/SLK due date assignment and scheduling on a single machine with two agents

Yunqiang Yin et al.

NAVAL RESEARCH LOGISTICS (2016)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Batch scheduling of identical jobs with controllable processing times

Baruch Mor et al.

COMPUTERS & OPERATIONS RESEARCH (2014)

Add to Collection

Article Engineering, Industrial

Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities

Yunqiang Yin et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2014)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Two-machine flowshop scheduling with flexible operations and controllable processing times

Zeynep Uruk et al.

COMPUTERS & OPERATIONS RESEARCH (2013)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Single-machine group scheduling with resource allocation and learning effect

Zhanguo Zhu et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2011)

Add to Collection

Article Engineering, Industrial

Group scheduling and due date assignment on a single machine

Shisheng Li et al.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2011)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Optimal due date assignment and resource allocation in a group technology scheduling environment

Dvir Shabtay et al.

COMPUTERS & OPERATIONS RESEARCH (2010)

Add to Collection

Review Mathematics, Applied

A survey of scheduling with controllable processing times

Dvir Shabtay et al.

DISCRETE APPLIED MATHEMATICS (2007)

Add to Collection

Article Engineering, Chemical

Environmentally conscious hoist scheduling for electroplating facilities

I Kuntay et al.

CHEMICAL ENGINEERING COMMUNICATIONS (2006)

Add to Collection

© Peeref 2019-2024. All rights reserved.