Pages that link to "Item:Q2467249"

The following pages link to A survey of scheduling problems with setup times or costs (Q2467249):

Displaying 50 items.

• Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints (Q2669504) (← links)
• Semiconductor final-test scheduling under setup operator constraints (Q2669721) (← links)
• Single machine batch scheduling with non-increasing time slot costs (Q2673533) (← links)
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
• Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry) (Q2676023) (← links)
• An iterative exact algorithm for the weighted fair sequences problem (Q2676411) (← links)
• A survey of methods for the solution of problems of scheduling theory (Q2718206) (← links)
• A batch scheduling problem with two agents (Q2788524) (← links)
• Online machine scheduling with family setups (Q2821094) (← links)
• An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives (Q2861560) (← links)
• Scheduling on parallel machines to minimise maximum lateness for the customer order problem (Q2873094) (← links)
• Batch scheduling on a two-machine jobshop with machine-dependent setup times (Q2892129) (← links)
• Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect (Q2954339) (← links)
• (Q2957491) (← links)
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
• Minimizing total tardiness in no-wait flowshops (Q2978428) (← links)
• Scheduling job shop problems with sequence-dependent setup times (Q3055268) (← links)
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285) (← links)
• Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times (Q3055422) (← links)
• SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (Q3114615) (← links)
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times (Q3163137) (← links)
• Optimising the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic (Q3163219) (← links)
• Parallel machine scheduling with preference of machines (Q3163231) (← links)
• Non-exhaustive family based dispatching heuristics–exploiting variances of processing and set-up times (Q3163249) (← links)
• Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups (Q3163328) (← links)
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times (Q3163716) (← links)
• Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms (Q3296266) (← links)
• Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
• Lot-Sizing and Sequencing on a Single Imperfect Machine (Q3627683) (← links)
• Survey of scheduling research involving setup times (Q4546846) (← links)
• Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
• A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
• Optimizing the production schedule of an agricultural cooperative: a case study (Q5059303) (← links)
• (Q5090421) (← links)
• A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem (Q5172421) (← links)
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) (← links)
• Group Scheduling with Two Competing Agents on a Single Machine (Q5174413) (← links)
• Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (Q5257894) (← links)
• Integration of Process Planning and Scheduling with Sequence Dependent Setup Time: A Case Study from Electrical Wires and Power Cable Industry (Q5357761) (← links)
• Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)
• Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem (Q6070990) (← links)
• On competitive analysis for polling systems (Q6072151) (← links)
• Flexible job-shop scheduling with transportation resources (Q6087485) (← links)
• Minimizing the total waiting time of intermediate products in a manufacturing process (Q6088134) (← links)
• Flowshop with additional resources during setups: mathematical models and a GRASP algorithm (Q6109559) (← links)
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
• An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date (Q6149341) (← links)
• Sensitivity analysis of the unrelated parallel machine scheduling problem with rework processes and machine eligibility restrictions (Q6168358) (← links)