Multitasking via alternate and shared processing: algorithms and complexity

DOI10.1016/j.dam.2016.03.018zbMath1343.90035OpenAlexW2509139847MaRDI QIDQ284835

Chung-Lun Li, Joseph Y.-T. Leung, Nicholas G. Hall

Publication date: 18 May 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.03.018

zbMATH Keywords

schedulingintractabilityefficient algorithmmotivations for multitasking

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Related Items (10)

Multitasking scheduling problems with two competitive agents ⋮ Streaming algorithms for multitasking scheduling with shared processing ⋮ Single-machine multitasking scheduling with job efficiency promotion ⋮ Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity ⋮ A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines ⋮ Multitasking scheduling with multiple rate‐modifying activities ⋮ A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones ⋮ Multitasking scheduling with alternate periods ⋮ Fatigue, personnel scheduling and operations: review and research opportunities ⋮ Due date assignment and two-agent scheduling under multitasking environment

Cites Work

• Unnamed Item
• Total completion time minimization on multiple machines subject to machine availability and makespan constraints
• Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
• Makespan minimization for parallel machines scheduling with multiple availability constraints
• Control of the service process in a queueing system
• Queueing systems with vacations - a survey
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• Scheduling

This page was built for publication: Multitasking via alternate and shared processing: algorithms and complexity