Two-agent single-machine scheduling with a rate-modifying activity

Review Computer Science, Information Systems

A review on job scheduling technique in cloud computing and priority rule based intelligent framework

Saydul Akbar Murad et al.

Summary: This research examines the planning and performance of job scheduling techniques in cloud computing, with a focus on addressing issues of resource waste and performance degradation caused by poor scheduling. Various strategies are explored, and a priority-based scheduling technique is proposed for fair job scheduling. The study aims to bridge gaps in existing research and provide academics and policymakers with information on the benefits of more efficient cloud computing setups.

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES (2022)

添加到收藏夹

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)

添加到收藏夹

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)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Scheduling with competing agents, total late work and job rejection

David Freud et al.

Summary: This study examines a single-machine scheduling problem involving two competing agents, with a focus on minimizing total late work and limiting job costs within a specified upper bound. An innovative pseudo-polynomial dynamic programming algorithm is introduced and tested on large-size instances, proving its effectiveness. The research also extends to job rejection scenarios, with modifications made to the algorithm for solving medium-size instances efficiently.

COMPUTERS & OPERATIONS RESEARCH (2021)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications