Kubiak, Wiesław On the complexity of open shop scheduling with time lags. (English) Zbl 1518.90025 J. Sched. 26, No. 3, 331-334 (2023). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{W. Kubiak}, J. Sched. 26, No. 3, 331--334 (2023; Zbl 1518.90025) Full Text: DOI arXiv
Györgyi, Péter; Kis, Tamás; Tamási, Tímea; Békési, József Joint replenishment meets scheduling. (English) Zbl 1517.90047 J. Sched. 26, No. 1, 77-94 (2023). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Györgyi} et al., J. Sched. 26, No. 1, 77--94 (2023; Zbl 1517.90047) Full Text: DOI arXiv
Mosheiov, Gur; Oron, Daniel; Shabtay, Dvir On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. (English) Zbl 1501.90030 J. Sched. 25, No. 5, 577-587 (2022). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{G. Mosheiov} et al., J. Sched. 25, No. 5, 577--587 (2022; Zbl 1501.90030) Full Text: DOI
Reynoso, Alejandro; Vakhania, Nodari Theoretical and practical issues in single-machine scheduling with two job release and delivery times. (English) Zbl 1480.90142 J. Sched. 24, No. 6, 615-647 (2021). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{A. Reynoso} and \textit{N. Vakhania}, J. Sched. 24, No. 6, 615--647 (2021; Zbl 1480.90142) Full Text: DOI
Sedding, Helmut A. Scheduling jobs with a V-shaped time-dependent processing time. (English) Zbl 1456.90078 J. Sched. 23, No. 6, 751-768 (2020). MSC: 90B35 68M20 68Q25 PDFBibTeX XMLCite \textit{H. A. Sedding}, J. Sched. 23, No. 6, 751--768 (2020; Zbl 1456.90078) Full Text: DOI
Hermelin, Danny; Shabtay, Dvir; Talmon, Nimrod On the parameterized tractability of the just-in-time flow-shop scheduling problem. (English) Zbl 1432.90058 J. Sched. 22, No. 6, 663-676 (2019). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{D. Hermelin} et al., J. Sched. 22, No. 6, 663--676 (2019; Zbl 1432.90058) Full Text: DOI arXiv
Burcea, Mihai; Hon, Wing-Kai; Liu, Hsiang-Hsuan; Wong, Prudence W. H.; Yau, David K. Y. Scheduling for electricity cost in a smart grid. (English) Zbl 1386.90047 J. Sched. 19, No. 6, 687-699 (2016). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{M. Burcea} et al., J. Sched. 19, No. 6, 687--699 (2016; Zbl 1386.90047) Full Text: DOI
Bock, Stefan Finding optimal tour schedules on transportation paths under extended time window constraints. (English) Zbl 1353.90056 J. Sched. 19, No. 5, 527-546 (2016). MSC: 90B35 68M20 90C39 90B06 PDFBibTeX XMLCite \textit{S. Bock}, J. Sched. 19, No. 5, 527--546 (2016; Zbl 1353.90056) Full Text: DOI
Wan, Long; Yuan, Jinjiang; Geng, Zhichao A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints. (English) Zbl 1320.90038 J. Sched. 18, No. 3, 315-323 (2015). MSC: 90B35 90C27 90C60 PDFBibTeX XMLCite \textit{L. Wan} et al., J. Sched. 18, No. 3, 315--323 (2015; Zbl 1320.90038) Full Text: DOI
Zheng, Feifeng; Xu, Yinfeng; Ma, Weimin; Zhang, E. Online scheduling with immediate and reliable lead-time quotation. (English) Zbl 1297.90063 J. Sched. 17, No. 3, 225-236 (2014). MSC: 90B35 90C60 68W27 PDFBibTeX XMLCite \textit{F. Zheng} et al., J. Sched. 17, No. 3, 225--236 (2014; Zbl 1297.90063) Full Text: DOI
Huo, Yumei; Reznichenko, Boris; Zhao, Hairong Minimizing total weighted completion time with an unexpected machine unavailable interval. (English) Zbl 1297.90047 J. Sched. 17, No. 2, 161-172 (2014). MSC: 90B35 90C60 68W25 PDFBibTeX XMLCite \textit{Y. Huo} et al., J. Sched. 17, No. 2, 161--172 (2014; Zbl 1297.90047) Full Text: DOI
Elalouf, Amir; Levner, Eugene; Tang, Huajun An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem. (English) Zbl 1297.90039 J. Sched. 16, No. 4, 429-435 (2013). MSC: 90B35 90C60 68M20 68W25 PDFBibTeX XMLCite \textit{A. Elalouf} et al., J. Sched. 16, No. 4, 429--435 (2013; Zbl 1297.90039) Full Text: DOI
Vakhania, Nodari A study of single-machine scheduling problem to maximize throughput. (English) Zbl 1297.90059 J. Sched. 16, No. 4, 395-403 (2013). MSC: 90B35 90C60 68M20 PDFBibTeX XMLCite \textit{N. Vakhania}, J. Sched. 16, No. 4, 395--403 (2013; Zbl 1297.90059) Full Text: DOI
Boysen, Nils; Bock, Stefan; Fliedner, Malte Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity. (English) Zbl 1280.90032 J. Sched. 16, No. 2, 185-198 (2013). MSC: 90B35 90B05 90C60 PDFBibTeX XMLCite \textit{N. Boysen} et al., J. Sched. 16, No. 2, 185--198 (2013; Zbl 1280.90032) Full Text: DOI
Shabtay, Dvir; Bensoussan, Yaron Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. (English) Zbl 1280.90070 J. Sched. 15, No. 1, 39-47 (2012). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{D. Shabtay} and \textit{Y. Bensoussan}, J. Sched. 15, No. 1, 39--47 (2012; Zbl 1280.90070) Full Text: DOI
Benabid, Abir; Hanen, Claire Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays. (English) Zbl 1280.68071 J. Sched. 14, No. 5, 511-522 (2011). MSC: 68M20 90B35 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Benabid} and \textit{C. Hanen}, J. Sched. 14, No. 5, 511--522 (2011; Zbl 1280.68071) Full Text: DOI HAL
Simonin, G.; Darties, B.; Giroudeau, R.; König, J.-C. Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. (English) Zbl 1280.90072 J. Sched. 14, No. 5, 501-509 (2011). MSC: 90B35 68M20 90C60 68W25 PDFBibTeX XMLCite \textit{G. Simonin} et al., J. Sched. 14, No. 5, 501--509 (2011; Zbl 1280.90072) Full Text: DOI arXiv
Brucker, Peter; Shakhlevich, Natalia V. A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. (English) Zbl 1230.90087 J. Sched. 14, No. 4, 371-389 (2011). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{N. V. Shakhlevich}, J. Sched. 14, No. 4, 371--389 (2011; Zbl 1230.90087) Full Text: DOI Link
Artigues, Christian; Briand, Cyril The resource-constrained activity insertion problem with minimum and maximum time lags. (English) Zbl 1176.90192 J. Sched. 12, No. 5, 447-460 (2009). MSC: 90B35 PDFBibTeX XMLCite \textit{C. Artigues} and \textit{C. Briand}, J. Sched. 12, No. 5, 447--460 (2009; Zbl 1176.90192) Full Text: DOI HAL
Roemer, Thomas A. A note on the complexity of the concurrent open shop problem. (English) Zbl 1154.90484 J. Sched. 9, No. 4, 389-396 (2006). MSC: 90B35 PDFBibTeX XMLCite \textit{T. A. Roemer}, J. Sched. 9, No. 4, 389--396 (2006; Zbl 1154.90484) Full Text: DOI
Steiner, George; Xue, Zhihui On the connection between a cyclic job shop and a reentrant flow shop scheduling problem. (English) Zbl 1154.90492 J. Sched. 9, No. 4, 381-387 (2006). MSC: 90B35 PDFBibTeX XMLCite \textit{G. Steiner} and \textit{Z. Xue}, J. Sched. 9, No. 4, 381--387 (2006; Zbl 1154.90492) Full Text: DOI
Sung, Shao Chin; Vlach, Milan Maximizing weighted number of just-in-time jobs on unrelated parallel machines. (English) Zbl 1123.90037 J. Sched. 8, No. 5, 453-460 (2005). MSC: 90B35 68M20 90C60 PDFBibTeX XMLCite \textit{S. C. Sung} and \textit{M. Vlach}, J. Sched. 8, No. 5, 453--460 (2005; Zbl 1123.90037) Full Text: DOI
Young, Gilbert H.; Chan, Chi-Lok Single-vehicle scheduling with time window constraints. (English) Zbl 0941.90042 J. Sched. 2, No. 4, 175-187 (1999). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{G. H. Young} and \textit{C.-L. Chan}, J. Sched. 2, No. 4, 175--187 (1999; Zbl 0941.90042) Full Text: DOI
Alon, Noga; Azar, Yossi; Woeginger, Gerhard J.; Yadid, Tal Approximation schemes for scheduling on parallel machines. (English) Zbl 0909.90168 J. Sched. 1, No. 1, 55-66 (1998). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Sched. 1, No. 1, 55--66 (1998; Zbl 0909.90168) Full Text: DOI
Woeginger, Gerhard J. A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times. (English) Zbl 0909.90184 J. Sched. 1, No. 2, 79-87 (1998). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{G. J. Woeginger}, J. Sched. 1, No. 2, 79--87 (1998; Zbl 0909.90184) Full Text: DOI