Generating Experimental Data for Computational Testing with Machine Scheduling Applications
From MaRDI portal
Publication:3635039
DOI10.1287/opre.49.6.854.10014zbMath1163.90490OpenAlexW2125955646MaRDI QIDQ3635039
Marc E. Posner, Nicholas G. Hall
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.49.6.854.10014
Related Items
One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective, Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs, Preemption in single machine earliness/tardiness scheduling, Total completion time with makespan constraint in no-wait flowshops with setup times, On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications, Managing Underperformance Risk in Project Portfolio Selection, Some complexity results and an efficient algorithm for quay crane scheduling problem, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, Minimizing maximum completion time in a proportionate flow shop with one machine of different speed, Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times, Generating new test instances by evolving in instance space, Acquisition planning and scheduling of computing resources, A multi-objective optimization for preemptive identical parallel machines scheduling problem, Robust Capacity Planning for Project Management, The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times, Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication, A single-machine scheduling problem with two-agent and deteriorating jobs, Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates, The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store, Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times, A two-agent single-machine scheduling problem with late work criteria, Scheduling of uniform parallel machines with s-precedence constraints, Robust spotter scheduling in trailer yards, The Vehicle Routing Problem with Release and Due Dates, Rescheduling for machine disruption to minimize makespan and maximum lateness, Processing time generation schemes for parallel machine scheduling problems with various correlation structures, Forming partnerships in a virtual factory, Single-machine scheduling with two competing agents and learning consideration, A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure, Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints, No-wait flowshop scheduling problem with two criteria; total tardiness and makespan, Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints, An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach, Heuristics for no-wait flowshops with makespan subject to mean completion time, Cost allocation in rescheduling with machine unavailable period, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, Measuring instance difficulty for combinatorial optimization problems, Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration, Two-agent scheduling with position-based deteriorating jobs and learning effects, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems, Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints, No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan, Two-stage assembly scheduling problem for minimizing total tardiness with setup times, Due-date quotation model for manufacturing system scheduling under uncertainty, Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds, Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, Scheduling projects with stochastic activity duration to maximize expected net present value, Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups, Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests, Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing, Algorithms for dynamic scheduling of unit execution time tasks, The coordination of scheduling and batch deliveries
