Pages that link to "Item:Q3635039"

The following pages link to Generating Experimental Data for Computational Testing with Machine Scheduling Applications (Q3635039):

Displaying 50 items.

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing (Q257213) (← links)
• Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• Generating new test instances by evolving in instance space (Q342041) (← links)
• Acquisition planning and scheduling of computing resources (Q342569) (← links)
• Rescheduling for machine disruption to minimize makespan and maximum lateness (Q490326) (← links)
• Processing time generation schemes for parallel machine scheduling problems with various correlation structures (Q490376) (← links)
• Single-machine scheduling with two competing agents and learning consideration (Q497627) (← links)
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
• Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
• A single-machine scheduling problem with two-agent and deteriorating jobs (Q611543) (← links)
• Scheduling of uniform parallel machines with s-precedence constraints (Q646123) (← links)
• The coordination of scheduling and batch deliveries (Q816348) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← links)
• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
• Forming partnerships in a virtual factory (Q940918) (← links)
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
• Scheduling projects with stochastic activity duration to maximize expected net present value (Q1042042) (← links)
• On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← links)
• A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan (Q1750472) (← links)
• Cost allocation in rescheduling with machine unavailable period (Q1754051) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
• Algorithms for dynamic scheduling of unit execution time tasks (Q1869578) (← links)
• A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure (Q1983744) (← links)
• Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← links)
• Due-date quotation model for manufacturing system scheduling under uncertainty (Q2058567) (← links)
• Robust spotter scheduling in trailer yards (Q2215562) (← links)
• Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) (← links)
• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints (Q2270437) (← links)
• No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan (Q2284308) (← links)
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times (Q2293429) (← links)
• A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers (Q2489134) (← links)
• Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)
• Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups (Q2565776) (← links)
• Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← links)
• The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times (Q2664350) (← links)
• Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)
• One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective (Q3156721) (← links)
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
• Managing Underperformance Risk in Project Portfolio Selection (Q3450467) (← links)
• An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4474722) (← links)
• An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4823493) (← links)
• Robust Capacity Planning for Project Management (Q5084614) (← links)
• The Vehicle Routing Problem with Release and Due Dates (Q5131700) (← links)
• Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration (Q5174416) (← links)
• Some complexity results and an efficient algorithm for quay crane scheduling problem (Q5298341) (← links)