A note on the scheduling with two families of jobs
From MaRDI portal
Publication:880524
DOI10.1007/s10951-005-4997-zzbMath1123.90040OpenAlexW2144698987MaRDI QIDQ880524
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-005-4997-z
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (42)
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ A scheduling problem with three competing agents ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Two-agent parallel-machine scheduling with rejection ⋮ Two-agent scheduling of time-dependent jobs ⋮ A single-machine scheduling problem with two-agent and deteriorating jobs ⋮ Approximation schemes for two-machine flow shop scheduling with two agents ⋮ Two-agent scheduling with agent specific batches on an unbounded serial batching machine ⋮ A note on a two-agent scheduling problem related to the total weighted late work ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ Scheduling two agents on uniform parallel machines with~makespan and cost functions ⋮ Single-machine multi-agent scheduling problems with a global objective function ⋮ A competitive two-agent scheduling problem on parallel machines with release dates and preemption ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Two-agent scheduling to minimize the maximum cost with position-dependent jobs ⋮ Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ A just-in-time scheduling problem with two competing agents ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ Multi-agent scheduling on a single machine with max-form criteria ⋮ Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Solving a two-agent single-machine scheduling problem considering learning effect ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ Two-agent single-machine scheduling problems under increasing linear deterioration ⋮ A two-machine flowshop problem with two agents ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
This page was built for publication: A note on the scheduling with two families of jobs
