Multitasking via alternate and shared processing: algorithms and complexity

DOI10.1016/J.DAM.2016.03.018MaRDI QIDQ284835zbMATHOpenAlexFDO

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

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

schedulingefficient algorithmintractabilitymotivations for multitasking

Mathematics Subject Classification ID

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

Recommendations

• Single-machine multitasking scheduling with job efficiency promotion
• Multitasking scheduling with alternate periods
• Multitasking scheduling problems with two competitive agents
• Multitasking scheduling problems with deterioration effect
• scientific article; zbMATH DE number 1271325

Cites work

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

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284835)