Pages that link to "Item:Q4147825"

The following pages link to Flowshop and Jobshop Schedules: Complexity and Approximation (Q4147825):

Displaying 50 items.

• Several flow shop scheduling problems with truncated position-based learning effect (Q336658) (← links)
• Flowshop scheduling with a general exponential learning effect (Q336933) (← links)
• Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage (Q337499) (← links)
• Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects (Q337503) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
• The optimal number of used machines in a two-stage flexible flowshop scheduling problem (Q398915) (← links)
• Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
• Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
• An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop (Q582206) (← links)
• Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
• Minimizing total completion time in two-stage hybrid flow shop with dedicated machines (Q622160) (← links)
• New results in the worst-case analysis for flow-shop scheduling (Q689950) (← links)
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
• Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
• A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
• Branch and bound algorithm for the flow shop with multiple processors (Q809880) (← links)
• The bipartite margin shop and maximum red matchings free of blue-red alternating cycles (Q834189) (← links)
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← links)
• A bicriteria flowshop scheduling problem with setup times (Q865584) (← links)
• A note on flow shop scheduling problems with a learning effect on no-idle dominant machines (Q879575) (← links)
• The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
• A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• Two machine flow shop scheduling problem with weighted WIP costs (Q954049) (← links)
• Flow shops with WIP and value added costs (Q969753) (← links)
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time (Q980257) (← links)
• Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778) (← links)
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
• Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
• On the complexity of generalized due date scheduling problems (Q1175769) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling (Q1278192) (← links)
• A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
• A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
• Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
• Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
• Performance of scheduling algorithms for no-wait flowshops with parallel machines (Q1310022) (← links)
• A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557) (← links)
• Two-machine ordered flowshop scheduling under random breakdowns (Q1341394) (← links)
• Job-shop scheduling with convex models of operations (Q1341401) (← links)
• Minimizing makespan in hybrid flowshops (Q1342286) (← links)
• Makespan minimization in preemptive two machine job shops (Q1377264) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686) (← links)
• Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (Q1569925) (← links)
• Flow shop and open shop scheduling with a critical machine and two operations per job (Q1590807) (← links)