Pages that link to "Item:Q1751258"

The following pages link to A survey of scheduling problems with no-wait in process (Q1751258):

Displaying 33 items.

• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan (Q1750472) (← links)
• An efficient bicriteria algorithm for stable robotic flow shop scheduling (Q1753515) (← links)
• Classifying and modeling setups and cleanings in lot sizing and scheduling (Q1753633) (← links)
• A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure (Q1983744) (← links)
• Air traffic flow management with layered workload constraints (Q2027028) (← links)
• A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions (Q2029954) (← links)
• Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
• No-wait two-stage flowshop problem with multi-task flexibility of the first machine (Q2054067) (← links)
• A two-machine no-wait flow shop problem with two competing agents (Q2075466) (← links)
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
• Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approach (Q2158042) (← links)
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects (Q2195404) (← links)
• An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs (Q2225197) (← links)
• \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources (Q2241156) (← links)
• Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times (Q2243380) (← links)
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times (Q2244222) (← links)
• Analysis of flow shop scheduling anomalies (Q2272295) (← links)
• Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
• No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan (Q2284308) (← links)
• Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (Q2289017) (← links)
• Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines (Q2305020) (← links)
• No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) (← links)
• Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems (Q2633191) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
• Resource allocation flowshop scheduling with learning effect and slack due window assignment (Q2666692) (← links)
• (Q5020580) (← links)
• Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects (Q5024914) (← links)
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
• Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
• A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
• Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times (Q6157771) (← links)
• A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (Q6193912) (← links)