A note on the scheduling with two families of jobs

From MaRDI portal
Publication:880524


DOI10.1007/s10951-005-4997-zzbMath1123.90040MaRDI QIDQ880524

N. E. Zubov

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


90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research


Related Items

Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration, Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures, Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, Single machine scheduling with two competing agents and equal job processing times, 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, A competitive two-agent scheduling problem on parallel machines with release dates and preemption, 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, Two-agent scheduling with position-based deteriorating jobs and learning effects, Two-agent single-machine scheduling problems under increasing linear deterioration, A single-machine scheduling problem with two-agent and deteriorating jobs, Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost, A two-machine flowshop problem with two agents, Two-agent scheduling on uniform parallel machines with min-max criteria, Two-agent scheduling with agent specific batches on an unbounded serial batching machine, Two-agent single machine scheduling with forbidden intervals, Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities, Two-agent parallel-machine scheduling with rejection, 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, Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs, Solving a two-agent single-machine scheduling problem considering learning effect, Approximation schemes for two-machine flow shop scheduling 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, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, A just-in-time scheduling problem with two competing agents, 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, ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost, Scheduling with release dates and preemption to minimize multiple max-form objective functions, Two-agent scheduling of time-dependent jobs, A note on a two-agent scheduling problem related to the total weighted late work, Scheduling two agents on uniform parallel machines with~makespan and cost functions, Single-machine multi-agent scheduling problems with a global objective function, Multi-agent scheduling on a single machine with max-form criteria, A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH, Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine



Cites Work