A survey of scheduling problems with no-wait in process

From MaRDI portal
Revision as of 06:48, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1751258

DOI10.1016/J.EJOR.2016.05.036zbMath1394.90002OpenAlexW2407506046MaRDI QIDQ1751258

Ali Allahverdi

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.036




Related Items (33)

Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problemsMulti-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobsScheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approachRelationship between common objective functions, idle time and waiting time in permutation flow shop schedulingResource allocation flowshop scheduling with learning effect and slack due window assignmentShop scheduling in manufacturing environments: a reviewA matheuristic for the MinMax capacitated open vehicle routing problemAn iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effectsSignificantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup timesA novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardinessUnnamed ItemTwo-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum latenessAn enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTsA better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure\(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resourcesEnhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup timesMinimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup timesNo-wait flowshop scheduling problem with two criteria; total tardiness and makespanAn efficient bicriteria algorithm for stable robotic flow shop schedulingClassifying and modeling setups and cleanings in lot sizing and schedulingAnalysis of flow shop scheduling anomaliesAir traffic flow management with layered workload constraintsA combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictionsCoupled task scheduling with exact delays: literature review and modelsNo-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespanJob sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithmSingle-machine online scheduling of jobs with non-delayed processing constraintNo-wait two-stage flowshop problem with multi-task flexibility of the first machineThree-stage ordered flow shops with either synchronous flow, blocking or no-idle machinesA two-machine no-wait flow shop problem with two competing agentsNo-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian pathsTwo-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejectionStudy on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects


Uses Software



Cites Work




This page was built for publication: A survey of scheduling problems with no-wait in process