A two-agent single-machine scheduling problem with late work criteria

From MaRDI portal
Revision as of 06:00, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1701708

DOI10.1007/s00500-015-1900-5zbMath1381.90040OpenAlexW1821414104MaRDI QIDQ1701708

Chin-Chia Wu, Du-Juan Wang, Peng-Hsiang Hsu, Yau-Ren Shiau, Chao-Chung Kang

Publication date: 27 February 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-015-1900-5




Related Items (16)

Pareto-scheduling of two competing agents with their own equal processing timesTwo-machine flow-shop scheduling to minimize total late work: revisitedPolynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early workScheduling with competing agents, total late work and job rejectionBicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late workPareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late workA survey of due-date related single-machine with two-agent scheduling problemSingle-machine preemptive scheduling with release dates involving the total weighted late work criterionA note on a two-agent scheduling problem related to the total weighted late workA new perspective on single-machine scheduling problems with late work related criteriaSingle-machine scheduling with multi-agents to minimize total weighted late workTwo-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectivesA Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work CriterionFully polynomial time approximation scheme to maximize early work on parallel machines with common due dateSingle-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late worksProportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs



Cites Work


This page was built for publication: A two-agent single-machine scheduling problem with late work criteria