EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Preemptive problems"
Narrow search

Narrow search

Year of publication
Subject
All
Identical machines 3 Preemptive problems 3 Scheduling 3 Algorithm 2 Algorithmus 2 Complexity 2 Scheduling problem 2 Scheduling-Verfahren 2 Theorie 2 Theory 2 Agreeability 1 Branch and Bound 1 Branch-and-Bound 1 Common due date 1 Dominant structure 1 Durchlaufzeit 1 Lead time 1 Operations Research 1 Operations research 1 Production control 1 Produktionssteuerung 1 Total tardiness 1
more ... less ...
Online availability
All
Undetermined 1
Type of publication
All
Article 3
Type of publication (narrower categories)
All
Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
English 2 Undetermined 1
Author
All
Bellenguez-Morineau, Odile 2 Prot, Damien 2 Bellenguez-Morineau, O. 1 Chrobak, Marek 1 Dürr, Christoph 1 Lahlou, C. 1 Lahlou, Chams 1 Prot, D. 1
more ... less ...
Published in...
All
Journal of scheduling 2 European Journal of Operational Research 1
Source
All
ECONIS (ZBW) 2 RePEc 1
Showing 1 - 3 of 3
Cover Image
A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines
Bellenguez-Morineau, Odile; Chrobak, Marek; Dürr, Christoph - In: Journal of scheduling 18 (2015) 3, pp. 299-304
Persistent link: https://www.econbiz.de/10011290711
Saved in:
Cover Image
New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
Prot, D.; Bellenguez-Morineau, O.; Lahlou, C. - In: European Journal of Operational Research 231 (2013) 2, pp. 282-287
In this paper, we are interested in parallel identical machine scheduling problems with preemption and release dates in case of a regular criterion to be minimized. We show that solutions having a permutation flow shop structure are dominant if there exists an optimal solution with completion...
Persistent link: https://www.econbiz.de/10010682506
Saved in:
Cover Image
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012)
Prot, Damien; Bellenguez-Morineau, Odile; Lahlou, Chams - In: Journal of scheduling 16 (2013) 4, pp. 437-438
Persistent link: https://www.econbiz.de/10009777772
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...