A multiple-criterion model for machine scheduling
From MaRDI portal
Publication:2464375
DOI10.1023/A:1022231419049zbMath1154.90406OpenAlexW2008118316MaRDI QIDQ2464375
J. Cole Smith, Kenneth R. Baker
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022231419049
Related Items (only showing first 100 items - show all)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem ⋮ Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Multitasking scheduling problems with two competitive agents ⋮ A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH ⋮ Unary NP-hardness of minimizing the number of tardy jobs with deadlines ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures ⋮ BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN ⋮ Hierarchical optimization on an unbounded parallel-batching machine ⋮ Two-agent scheduling of time-dependent jobs ⋮ Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem ⋮ Competitive two-agent scheduling with release dates and preemption on a single 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 ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ A multiple-criterion model for machine scheduling with constant deteriorating jobs ⋮ Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives ⋮ Scheduling two agents on uniform parallel machines with~makespan and cost functions ⋮ Single-machine multi-agent scheduling problems with a global objective function ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Unnamed Item ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ Multi-agent scheduling on a single machine with max-form criteria ⋮ Multi-agent single machine scheduling ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN ⋮ Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design ⋮ Multicriteria scheduling ⋮ Two-agent scheduling with rejection on a single machine ⋮ Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs ⋮ Two agent scheduling with a central selection mechanism ⋮ Scheduling two agent task chains with a central selection mechanism ⋮ A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints ⋮ Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ Single-machine serial-batch delivery scheduling with two competing agents and due date assignment ⋮ Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness ⋮ Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Two-agent scheduling in a flowshop ⋮ Routing and scheduling problems with two agents on a line-shaped network ⋮ 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 ⋮ Single machine scheduling with interfering job sets ⋮ A scheduling problem with three competing agents ⋮ Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Complexities of four problems on two-agent scheduling ⋮ NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Maximum latency scheduling problem on two-person cooperative games ⋮ Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ A lower bound for minimizing the total completion time of a three-agent scheduling problem ⋮ Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives ⋮ A note on the scheduling with two families of jobs ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Two-agent parallel-machine scheduling with rejection ⋮ 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 survey of due-date related single-machine with two-agent scheduling problem ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Single machine batch scheduling with two competing agents to minimize total flowtime ⋮ Two-agent scheduling to minimize the total cost ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ A competitive two-agent scheduling problem on parallel machines with release dates and preemption
This page was built for publication: A multiple-criterion model for machine scheduling
