Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the General Job-Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the job-shop problem with two jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum lateness in a two-machine unit-time job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search to the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate duality relaxation for job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-machine scheduling with release and due dates to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Review of Production Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine sequence dependent flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Model and a Graphical Algorithm for a Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Formulation for the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Scheduling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and evaluation of static flowshop scheduling heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum lateness on one machine: computational experience and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop Sequencing Problem with Ordered Processing Time Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequency on two and three machines with setup, processing and removal times separated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Shop Problems with Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Sequencing <i>n</i> Jobs on <i>m</i> Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00129-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075696138 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:13, 30 July 2024

scientific article
Language Label Description Also known as
English
Reduction of job-shop problems to flow-shop problems with precedence constraints
scientific article

    Statements

    Reduction of job-shop problems to flow-shop problems with precedence constraints (English)
    0 references
    0 references
    0 references
    2 August 1999
    0 references
    optimization
    0 references
    scheduling
    0 references
    job-shop environment
    0 references
    flow-shop
    0 references
    heuristics
    0 references
    0 references
    0 references

    Identifiers