Pages that link to "Item:Q919994"

The following pages link to A state-of-the-art review of parallel-machine scheduling research (Q919994):

Displaying 50 items.

• Parallel machines scheduling with machine preference via agent-based approach (Q272606) (← links)
• Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
• Minimizing resource consumption on uniform parallel machines with a bound on makespan (Q336672) (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times (Q337126) (← links)
• Energy-oriented scheduling based on evolutionary algorithms (Q337370) (← links)
• Acquisition planning and scheduling of computing resources (Q342569) (← links)
• The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions (Q398926) (← links)
• Improving fleet utilization for carriers by interval scheduling (Q439488) (← links)
• A composite algorithm for multiprocessor scheduling (Q544815) (← links)
• Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
• Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← links)
• Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
• Mass customization in videotape duplication and conversion: challenges of flexible duplication systems, fast delivery, and electronic service (Q850876) (← links)
• Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory (Q857327) (← links)
• Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
• Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
• Scheduling problems in master-slave model (Q940888) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• Parallel machine scheduling with precedence constraints and setup times (Q991370) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
• Minimizing the number of tardy jobs for \(m\) parallel machines (Q1127174) (← links)
• Minimizing the schedule length for a parallel 3D-grid precedence graph (Q1278401) (← links)
• Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
• Scheduling under a common due-date on parallel unrelated machines (Q1291766) (← links)
• Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines (Q1295836) (← links)
• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
• A variant of time minimizing assignment problem (Q1303581) (← links)
• Flowshop scheduling with identical jobs and uniform parallel machines (Q1303728) (← links)
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs (Q1315994) (← links)
• Optimal multiprocessor task scheduling using dominance and equivalence relations (Q1318466) (← links)
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) (← links)
• A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations (Q1333456) (← links)
• Minimizing makespan in hybrid flowshops (Q1342286) (← links)
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
• Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
• Scheduling jobs within time windows on identical parallel machines: New model and algorithms (Q1388825) (← links)
• Parallel machine scheduling of machine-dependent jobs with unit-length. (Q1426708) (← links)
• Parallel machine scheduling with splitting jobs (Q1570839) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Scheduling with job-splitting considering learning and the vital-few law (Q1652529) (← links)
• A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem (Q1692274) (← links)
• Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
• A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria (Q1762126) (← links)
• Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
• A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
• A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)