Two-agent single-machine scheduling with assignable due dates

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

Publication:2250186

DOI10.1016/j.amc.2012.08.008zbMath1291.90102OpenAlexW2058459342MaRDI QIDQ2250186

Wen-Hsiang Wu, Chin-Chia Wu, Shuenn-Ren Cheng, Yunqiang Yin, Cheng, T. C. Edwin

Publication date: 4 July 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.08.008




Related Items (20)

Multitasking scheduling problems with two competitive agentsA greedy heuristic for solving scheduling problems with bounded rejection costSingle machine scheduling with rejection and generalized parametersA tabu method for a two-agent single-machine scheduling with deterioration jobsTwo-agent flowshop scheduling to maximize the weighted number of just-in-time jobsMinimizing tardiness scheduling measures with generalized due-dates and a maintenance activityTwo-Machine and Two-Agent Flow Shop with Special Processing Times StructuresTwo-agent single machine scheduling with forbidden intervalsOrder acceptance and scheduling with delivery under generalized parametersA two-agent single-machine scheduling problem to minimize the total cost with release datesA two-agent single-machine scheduling problem with late work criteriaA note on two-agent scheduling with resource dependent release times on a single machineA single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithmsA just-in-time scheduling problem with two competing agentsTwo-agent scheduling on a single machine with release datesA Batch Scheduling Problem with Two AgentsMinimizing total late work on a single machine with generalized due-datesMinimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due datesAn Ordered Flow Shop with Two AgentsOn the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates



Cites Work




This page was built for publication: Two-agent single-machine scheduling with assignable due dates