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.

• An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics (Q2273664) (← links)
• A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times (Q2285809) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times (Q2293429) (← links)
• Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
• Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints (Q2294600) (← links)
• Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines (Q2317137) (← links)
• A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
• Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost (Q2333219) (← links)
• A scheduling problem in the baking industry (Q2336885) (← links)
• Scheduling multi-colour print jobs with sequence-dependent setup times (Q2341398) (← links)
• Single-machine batch scheduling of linear deteriorating jobs (Q2344768) (← links)
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry (Q2358497) (← links)
• Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times (Q2378452) (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
• Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times (Q2389069) (← links)
• Modeling job shop scheduling with batches and setup times by timed Petri nets (Q2389898) (← links)
• A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines (Q2393485) (← links)
• Scatter search for minimizing weighted tardiness in a single machine scheduling with setups (Q2403268) (← links)
• Scheduling two-stage jobs on multiple flowshops (Q2419124) (← links)
• Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
• New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives (Q2424773) (← links)
• Single machine scheduling with a general exponential learning effect (Q2428939) (← links)
• Integrated batch sizing and scheduling on a single machine (Q2434256) (← links)
• Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints (Q2434297) (← links)
• The significance of reducing setup times/setup costs (Q2467248) (← links)
• Learning and forgetting effects on a group scheduling problem (Q2467250) (← links)
• Single-machine scheduling problems with past-sequence-dependent setup times (Q2467251) (← links)
• A single machine batch scheduling problem with bounded batch size (Q2467253) (← links)
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)
• Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times (Q2467255) (← links)
• A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs (Q2467257) (← links)
• Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint (Q2467258) (← links)
• Competitive online scheduling of perfectly malleable jobs with setup times (Q2467259) (← links)
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
• Multi-family scheduling in a two-machine reentrant flow shop with setups (Q2467261) (← links)
• Single-job lot streaming in \(m - 1\) two-stage hybrid flowshops (Q2467262) (← links)
• Flow-shop scheduling with setup and assembly operations (Q2467263) (← links)
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints (Q2467264) (← links)
• Balancing and scheduling tasks in assembly lines with sequence-dependent setup times (Q2467265) (← links)
• A quantitative approach for scheduling activities to reduce set-up in multiple machine lines (Q2467267) (← links)
• Single item lot-sizing problem for a warm/cold process with immediate lost sales (Q2467270) (← links)
• Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock (Q2467271) (← links)
• Open-shop batch scheduling with identical jobs (Q2467272) (← links)
• An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
• Two-machine open shop problem with a single server and set-up time considerations (Q2663040) (← links)
• A comparative study of solution representations for the unrelated machines environment (Q2664345) (← links)
• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)